A    Seminar Presentation On“Dynamic Cache Management        Technique”                    Presented By:                  ...
Content Introduction to cache memory How stored data is transferred to the CPU Mapping functions Dynamic Cache Managem...
Introduction to cache memory A cache, in computer terms, is a place to store  information thats faster than the place whe...
How stored data is transferred to the             CPU ??
Mapping functions    Since M>>C, how are blocks mapped to specific lines    in cache.1. Direct mapping2. Associative mapp...
Dynamic Cache Management It’s resizing strategy of the cache memory Dynamic caching allows for dynamic resizing both  ac...
POWER TRENDS FOR CURRENT   MICROPROCESSORS
DYNAMIC TECHNIQUES FOR L0-CACHE          MANAGEMENT1. Simple Method.2. Static Method.3. Dynamic Confidence Estimation Meth...
SIMPLE METHOD If a branch predictor is mispredicted, the machine will  access the I-cache to fetch the instructions. If ...
STATIC METHOD    If a ‘high confidence’ branch was predicted incorrectly,    the I-cache is accessed for the subsequent b...
DYNAMIC CONFIDENCE ESTIMATION               METHOD   It is a dynamic version of the static method.   The confidence of t...
RESTRICTIVE DYNAMIC CONFIDENCE          ESTIMATION METHOD    Restrictive dynamic scheme is a more selective scheme    in ...
Dynamic Distance Estimation Method All n branches after a mispredicted branch are tagged as  ‘low confidence’ otherwise a...
Thank youAny Query ??
Upcoming SlideShare
Loading in …5
×

Dynamic cache management

461 views

Published on

cache memory management techniques

Published in: Education, Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
461
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
10
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Dynamic cache management

  1. 1. A Seminar Presentation On“Dynamic Cache Management Technique” Presented By: Ajay Singh Lamba (IT , Final Year)
  2. 2. Content Introduction to cache memory How stored data is transferred to the CPU Mapping functions Dynamic Cache Management Dynamic Techniques For L0-cache Management
  3. 3. Introduction to cache memory A cache, in computer terms, is a place to store information thats faster than the place where the information is usually stored Cache memory is fast memory that is used to hold the most recently accessed data Only frequently accessed data will stay in cache, which allows the CPU to access it more quickly it is placed in the processor chip, which allows it to talk with the processor direct at a much higher speed than standard RAM.
  4. 4. How stored data is transferred to the CPU ??
  5. 5. Mapping functions Since M>>C, how are blocks mapped to specific lines in cache.1. Direct mapping2. Associative mapping3. Set associative mapping
  6. 6. Dynamic Cache Management It’s resizing strategy of the cache memory Dynamic caching allows for dynamic resizing both across and within applications execution. The basic idea is that only the most frequently executed portion of the code should be stored in the L0-cache
  7. 7. POWER TRENDS FOR CURRENT MICROPROCESSORS
  8. 8. DYNAMIC TECHNIQUES FOR L0-CACHE MANAGEMENT1. Simple Method.2. Static Method.3. Dynamic Confidence Estimation Method.4. Restrictive Dynamic Confidence Estimation Method.5. Dynamic Distance Estimation Method.
  9. 9. SIMPLE METHOD If a branch predictor is mispredicted, the machine will access the I-cache to fetch the instructions. If a branch is predicted correctly, the machine will access the L0-cache. In a misprediction , the machine will start fetching the instructions from the correct address by accessing the I- cache.
  10. 10. STATIC METHOD If a ‘high confidence’ branch was predicted incorrectly, the I-cache is accessed for the subsequent basic blocks. If more than n low confidence branches have been decoded in a row, the I-cache is accessed. Therefore the L0-cache will be bypassed when either of the two conditions are satisfied. In any other case the machine will access the L0-cache.
  11. 11. DYNAMIC CONFIDENCE ESTIMATION METHOD It is a dynamic version of the static method. The confidence of the I-cache is accessed if 1. A high confidence branch is mispredicted. 2. More than n successive ‘low confidence’ branches are encountered. it is more accurate in characterizing a branch and, then, regulating the access of the L0-cache.
  12. 12. RESTRICTIVE DYNAMIC CONFIDENCE ESTIMATION METHOD Restrictive dynamic scheme is a more selective scheme in which only the really important basic blocks would be selected for the L0-cache. The L0-cache is accessed only if a ‘high confidence’ branch is predicted correctly. The I-cache is accessed in any other case. This method selects some of the most frequently executed basic blocks, yet it misses some others.
  13. 13. Dynamic Distance Estimation Method All n branches after a mispredicted branch are tagged as ‘low confidence’ otherwise as ‘high confidence’. The basic blocks after a ‘low confidence’ branch are fetched from the L0-cache. The net effect is that a branch misprediction causes a series of fetches from the I-cache. A counter is used to measure the distance of a branch from the previous mispredicted branch.
  14. 14. Thank youAny Query ??

×