Simulators
Cache simulator
Each address is split into tag, set and offset bits, looked up, and either hits or is loaded, throwing out the least recently used block when its set is full.
The simulator
Cache simulator: how to use it
Choose the number of lines, the block size and the associativity (direct-mapped, set-associative or fully associative), then type your own list of addresses.
Lessons that use it
- Cache memory (Architecture)How a cache finds data: blocks, direct-mapped and set-associative placement, the tag, index and offset bits of an address, replacement and write policies.
See also
- CPU scheduling simulator
- Page replacement simulator
- Banker's algorithm simulator
- Disk scheduling simulator
- Race condition simulator
- Truth table maker
- Gradient descent simulator
- K-means clustering simulator
- Subnet calculator
- Sliding window simulator
- TCP congestion control simulator
- Karnaugh map solver
- Flip-flop simulator
- Ripple-carry adder
- 5-stage pipeline simulator