number 2 There are three small caches (direct mapped, 2-way set associative, and

Question

number 2

There are three small caches (direct mapped, 2-way set associative, and fully associative), each consisting of four one-word blocks. Find the number of misses for each cache replacement policy = FIFO. Assuming a cache of 1K blocks and a 32-bit address, find the total number of sets and the total number of tag bits for caches (direct mapped, 2-way and 4-way set associative, and fully associative). (1 block = 8 words) Consider a virtual memory system with the following properties: -42-bit virtual memory address 1-KB size pages -32-bit physical byte address What is the total size (in bits) of the page table for each process on this machine, assuming that the valid, dirty, and reference bits take a total of 3 bits and that all the virtual pages are in use?

Explanation / Answer

It is specified that there are 8 words per block.

This means 28=256 bytes per block. A 32 bit address gives 32-4=28 bytes to store the index and tag.

In the case of direct-mapped cache, the number of sets is the same as the number of blocks.

index=log2(1k)=10 bits

Total number of tag bits=(28-10)*1K sets=18*1=18Kbits

Related Questions

Navigate

• Browse (All)
• Browse N
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.