Operating Systems 2 EN -- OSDI -- 2006-2007 -- info.uvt.ro
Operating Systems 2 EN -- 2006-2007 -- info.uvt.ro
- Operating Systems 2 EN -- Assignment -- 2006-2007 -- info.uvt.ro
- Operating Systems 2 EN -- Laboratory 1 -- 2006-2007 -- info.uvt.ro
- Operating Systems 2 EN -- Laboratory 5 -- 2006-2007 -- info.uvt.ro
- Operating Systems 2 EN -- Laboratory 6 -- 2006-2007 -- info.uvt.ro
- Operating Systems 2 EN -- OSDI -- 2006-2007 -- info.uvt.ro
Chapter 4 -- Memory Management
edit- Basic Memory Management
- Mono-programming without swapping or paging
- Multi-programing with fixed partitions
- Fixed memory partitions with separate job queues
- Fixed memory partitions with a single job queue
- Relocation and protection
- Swapping
- Allocating space for a growing data segment
- Allocating space for a growing stack and data segment
- Memory management with bitmaps
- Memory management with linked lists
- First fit
- Next fit
- Best fit
- Worst fit
- Quick fit
- Separate lists for processes and holes
- Sorted lists by size
- Virtual memory
- Overlays
- Paging
- Virtual addresses
- Virtual address space
- Physical addresses
- MMU -- Memory Management Unit
- Pages
- Virtual page
- Page frame
- Page fault
- Virtual addresses
- Page tables
- Page number
- Offset
- Register page tables
- Memory page tables
- Multi-level page tables
- Structure of a page table entry
- Page frame number
- Present / absent
- Protection
- Modified
- Referenced
- Caching disabled
- TLB -- Table lookaside buffer
- Locality of reference
- TLB fault
- Inverted Page Tables
- Page replacement algorithms
- Optimal page replacement algorithm
- NRU -- Not recently used page replacement algorithm
- Page classes
- FIFO -- First-in first-out page replacement algorithm
- Second change page replacement algorithm
- Clock page replacement algorithm
- LRU -- Least recently used page replacement algorithm
- Simulating LRU in software
- NFU -- Not frequently used