Data storage capacity
2
Find n,C,k and M for following memory system. Catch holds – 64kb of data Data is transtered between cache and main memory. Main memory consists of 16MB with each bite directly addressable. 2 n = 16M number of blocks = 16/4 = 4M 2 n = 2 4 .2 20 :. n=24 Word size= 1B K= number of blocks * A word size K= 1*4 K= 4B C = 64KB/4B C= 16k Elements of cache design. Cache design – It’s good to have a small cache so that the overall average cost per bit is close to that of main memory alone and large enough. Because of that the overall access time is closer to that of the cache alone. Rather having large cache which is tend to be slightly slower than the smaller ones. Cache size is limited by the available chip and board area. MAPPING Algorithm is needed for mapping main memory blocks in to cache lines. A means is needed for determining which memory clock currently occupies a cache line.
-
Upload
thilini-boomawala -
Category
Documents
-
view
3 -
download
0
description
Information technology. lesson no 1
Transcript of Data storage capacity
Find n,C,k and M for following memory system.
Catch holds 64kb of dataData is transtered between cache and main memory.Main memory consists of 16MB with each bite directly addressable.2n= 16Mnumber of blocks = 16/4 = 4M2n= 24.220:. n=24Word size= 1BK= number of blocks * A word sizeK= 1*4K= 4BC = 64KB/4BC= 16k
Elements of cache design.Cache design Its good to have a small cache so that the overall average cost per bit is close to that of main memory alone and large enough. Because of that the overall access time is closer to that of the cache alone. Rather having large cache which is tend to be slightly slower than the smaller ones. Cache size is limited by the available chip and board area.
MAPPING Algorithm is needed for mapping main memory blocks in to cache lines. A means is needed for determining which memory clock currently occupies a cache line. The choice of mapping function determines the way the cache is organized
