[CSE]  Advanced Operating Systems 
 COMP9242 2002/S2 
UNSW

PRINTER Printer-Friendly Version
Administration               
- Notices
- Course Intro
- Consultations
# On-line Survey (closed)
- Survey Results
 
Work
- Lectures
- Milestone 0
- Project Admin
- Project Spec
- Project FAQ
- Exam
 
Documentation
- ASysT Lab
- L4 source browser
- Sulima ISA Simulator
R4x00 ISA Summary 
MIPS R4700 ReferenceMIPS R4000 User Manual 
- Network Driver
- GT64111
 
Related Info
- Aurema OS Prize
- OS Hall of Fame
 
History
- 2000
- 1999
- 1998
 
Staff
- Gernot Heiser (LiC)

 
Valid HTML 4.0!
next up previous
Next: Cache write (update) policy Up: 03-cache Previous: Cache mapping

Cache replacement policy


  • Indexing (via virtual or physical address) points to line set.

  • If all lines of set are valid must replace an existing one.

  • Replacement strategy must be simple as it's all done in hardware.

  • Dirty bit is used to determine whether a line must be flushed back to memory before invalidation.

  • Typical policies:
    • LRU (or approximation)
    • FIFO
    • random



Gernot Heiser 2002-08-15