Q4: If the size of the main memoryis 64 blocks, size of the cache is 16blocks and block size 8 words (forMM and CM).. Assume that thesystem uses Direct mappinganswer for the following.1. Word field bit is4.bits3.bitsNon above6.bitsOther:2. Tag fieldNon above6.bits4.bits2.bits3. The number of bits in the cachememory is4.bitsNon above6.bits2.bits

Answered: Image /qna-images/answer/5a3a4350-df64-48cc-99d6-51c184c10a6c.jpg

1. Word field bit is" O O Q4: If the size of the main memory is 64 blocks, size of the cache is 16 blocks and block size 8 words (for MM and CM).. Assume that the system uses Direct mapping answer for the following. OO 4.bits 3.bits Non above 6.bits Other: 2. Tag field Non above 6.bits 4.bits 2.bits 3. The number of bits in the cache memory is 4.bits Non above 6.bits 2.bits

1. Word field bit is" O O Q4: If the size of the main memory is 64 blocks, size of the cache is 16 blocks and block size 8 words (for MM and CM).. Assume that the system uses Direct mapping answer for the following. OO 4.bits 3.bits Non above 6.bits Other: 2. Tag field Non above 6.bits 4.bits 2.bits 3. The number of bits in the cache memory is 4.bits Non above 6.bits 2.bits

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 2VE

See similar textbooks

Similar questions

Design a Cache memory for your Project for a direct-mapped cachewith 1MB of data .• Design a Cache memory for your Project for a direct-mapped cachewith 64KB of data .Assume n-word block size, assuming a N-bitaddress? N=19 n=5
The caches are valuable for two reasons: how do they address the problem? Are they causing any problems? So, if it's possible to create a cache that's the same size as the device it's caching for (for example, a disk cache), why not do that, and remove the device?
Which of the two caches is faster, the L1 or the L2? Which is the smaller of the two? What is the reason behind its diminutive size?
When a request exceeds the cache's capacity, the CPU sends the data to main memory and the write buffer returns it. Next steps?
Compare in detail in the table the difference between: Cache memory and main memory and register ? 1-LOCATION 2-VOLATILITY 3-ACCESSIBILITY 4-FUNCTION 5-HARDWARE STRUCTURE 6-COST 7-SIZE 8- WRITING SPEED 9-STORAGE LIMIT You must write the references and put the link to them???.
A computer using a direct mapped cache has 220 Bytes of memory (byte addressable) and a cache of 32 blocks, each block contains 16 Bytes. a. How many blocks of main memory are there? b. What will be the sizes of the tag, index, and byte offset fields? c. To which cache set will the memory address 0x0DB63 map?
instruction is in the first picture cacheSim.h #include<stdlib.h>#include<stdio.h>#define DRAM_SIZE 1048576typedef struct cb_struct {unsigned char data[16]; // One cache block is 16 bytes.u_int32_t tag;u_int32_t timeStamp; /// This is used to determine what to evict. You can update the timestamp using cycles.}cacheBlock;typedef struct access {int readWrite; // 0 for read, 1 for writeu_int32_t address;u_int32_t data; // If this is a read access, value here is 0}cacheAccess;// This is our dummy DRAM. You can initialize this in anyway you want to test.unsigned char * DRAM;cacheBlock L1_cache[2][2]; // Our 2-way, 64 byte cachecacheBlock L2_cache[4][4]; // Our 4-way, 256 byte cache// Trace points to a series of cache accesses.FILE *trace;long cycles;void init_DRAM();// This function print the content of the cache in the following format for an N-way cache with M Sets// Set 0 : CB1 | CB2 | CB 3 | ... | CB N// Set 1 : CB1 | CB2 | CB 3 | ... | CB N// ...// Set M-1 : CB1 | CB2 | CB…
Below is a list of 32-bit memory address references, given as memory addresses. 12, 720, 172, 8, 764, 352, 760, 56, 724, 176, 744You would like to access a cache with the given memory addresses. The size of cache is 23 = 8-blocks. Your task is to: (1) find out the binary address, (2) fill out the tag and index for each memory address and (3) indicate whether the access is hit or miss in the following table:
Draw a line between a cache that is fully associative and one that is directly mapped out.
Assume you have a cache/memory system with the following characteristics: Size of a word: 8 bytes Size of a cache block: 32 words Size of the cache: 1024 words How many bits are in the tag if the cache is: direct-mapped, 2-way set associative, 4-way set associative, fully associative? Why?
What is the role of a cache that is completely associative?
Consider the following main memory word reference string; start with an empty cache all block initially marked as not valid Using Spatial Locality: 1 3 5 1 0 7 2 4 1 3 Find the number of requests? Find number of Hits? Find number of Misses? Please explain in details and fast!Thanks