








Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
This course focuses on quantitative principle of computer design, instruction set architectures, datapath and control, memory hierarchy design, main memory, cache, hard drives, multiprocessor architectures, storage and I/O systems, computer clusters. This lecture includes: Caching, locality, performance, Metrics, Design, Addressing, Techniques, staging, Spatial
Typology: Slides
1 / 14
This page cannot be seen from the preview
Don't miss anything!









Concept of Caching Principle of Locality
Cache device is a small SRAM which is made directly accessible to the processor
Cache sits between normal main memory and CPU as data and instruction caches and may be located on CPU chip or as a module
Data transfer between cache - CPU, and cache- Main memory is performed by the cache controller
Cache and main memory is organized in equal sized blocks
CPU requests contents of main memory location
Controller checks cache blocks for this data
If present, i.e., HIT, it gets data or instruction from cache - fast
If not present, i.e., MISS, it reads required block from main memory to cache, then deliver from cache to CPU
Miss rate, Miss Penalty, and Average access time are the major trade-off of Cache Memory performance
Miss Rate: is the fraction of memory accesses that are not found in the level-k memory or say the cache number of misses Miss Rate = total memory accesses As, Hit rate is defined as the fraction of memory access that are found in the level-k memory or say the cache, therefore Miss Rate = 1 – Hit Rate
The performance of a CPU is the product of clock cycle time and sum of CPU clock cycles and memory stall cycles
CPU Execution Time = (CPU Clock Cycles + Memory Stall Cycles) x clock cycle time Where,
memory stall cycles=
= Number of Misses x Miss Penalty
= IC x (Misses / Instructions)x Miss Penalty
= IC x [(Memory Access / Instructions)] x Miss Rate x Miss Penalty