[Feature]: Cache Simulator

[prajwal3114]

So, what is it about?

🧠 Overview

This project is a C++ Cache Memory Simulator that emulates how a CPU cache interacts with main memory.
It supports multiple cache replacement policies and tracks cache hits, misses, and overall efficiency.

This simulation helps understand Operating System and Computer Architecture concepts such as:

• Memory hierarchy
• Temporal and spatial locality
• Page and block replacement algorithms

---

🚀 Features

✅ Implements major cache replacement strategies:

• FIFO (First-In First-Out)
• LRU (Least Recently Used)
• LFU (Least Frequently Used)
• (Optional) Optimal (Belady’s Algorithm) for theoretical comparison

✅ Supports:

• Custom cache size and block size
• Variable access sequences
• Display of current cache state after each access
• Hit/Miss statistics
• Average memory access time (AMAT) calculation

✅ Well-structured using OOP principles:

class CacheBlock;
class Cache;
class ReplacementPolicy;          // Abstract base class
class FIFOReplacement : public ReplacementPolicy;
class LRUReplacement  : public ReplacementPolicy;
class LFUReplacement  : public ReplacementPolicy;
class CacheSimulator;


### Code of Conduct

- [x] I agree to follow this project's Code of Conduct

[sharvil-lade]

@prajwal3114 assign this issue to me

[LONECODER1]

@prajwal3114 assign this issue to me

[indrasuthar07]

@prajwal3114 sir assign it to me, I’ll get it done ASAP

[prajwal3114]

@LONECODER1 Assigned this to you — please complete it by November 13th.

[sharvil-lade]

@prajwal3114 assign this issue to me if it is not done by today.

[LONECODER1]

I will submit it today working on it