I need help with my computer organization and architecture homework question: Pe

Question

I need help with my computer organization and architecture homework question:

Perform cache replacement using three types of cache replacement algorithms

This problem explores the problem of thrashing in different types of cache. Consider a system of 12Kbytes of main memory partitioned into blocks of 1Kbytes each. The system has cache of size 4Kbytes. The main memory blocks are being accessed in the following order: 1, 9, 2, 9, 6, 1 (the numbers are in decimal). Assuming the cache is empty at the start. Show whether each memory block access is a hit or a miss. Then, compute the hit ratio for each of the following cases.

The system uses directly mapped cache; (20 points)

Memory Block

Maps to Cache Block

Hit/Miss

1

9

2

9

6

1

Hit ratio:

The system uses fully associative cache and first-in-first-out replacement policy; (20 points)

Memory Block

To Cache Block

Hit/Miss

1

9

2

9

6

1

Hit ratio:

The system uses 2-way set associative cache and first-in-first-out replacement policy. (20 points)

Memory Block

Maps to Cache

Hit/Miss

Set

Block

1

9

2

9

6

1

Hit ratio:

Memory Block

Maps to Cache Block

Hit/Miss

1

9

2

9

6

1

Hit ratio:

Explanation / Answer

Cache Replacement Algorithm-
In computing, cache algorithms (also often referred to as replacement algorithms or replacement policies)area unit optimizinginstructions

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

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