Cache memory
Upcoming SlideShare
Loading in...5
×

Like this? Share it with your network

Share
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Be the first to comment
No Downloads

Views

Total Views
535
On Slideshare
535
From Embeds
0
Number of Embeds
0

Actions

Shares
Downloads
14
Comments
0
Likes
1

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide

Transcript

  • 1. oEach entry also has a Diagramwhich memory cache tag, of a CPUspecifies the identity of the datum inthe backing store of which the entry isa copy.oWhen the cache client needs toaccess a datum presumed to exist inthe backing store, it first checks thecache.oIf an entry can be found with a tagmatching that of the desired datum,the datum in the entry is usedinstead. cacheoThe percentage of accesses that Diagram of a CPU memoryresult in cache hits is known as cache memory cachethe hit rate or hit ratio of the cache.percentage of accesses that result in cache hits is known as the hit rate or hit ratio of the cache.
  • 2. When a system writes a datum to cache, it must at some point write that datum to backing store as well. The timing of this write is controlled by what is known as the write policy.There are two basic writing approaches: Write-through - Write is done synchronously both to the cache and to the backing store. Write-back- Writing is done only to the cache. A modified cache block is written back to the store, just before it is replaced.
  • 3. More expensiveConsumes more power Low density