Useful Links
Computer Science
Operating Systems
Memory Management
1. Fundamentals of Memory Management
2. Address Spaces and Binding
3. Contiguous Memory Allocation
4. Non-Contiguous Memory Allocation: Paging
5. Non-Contiguous Memory Allocation: Segmentation
6. Virtual Memory
7. Advanced Memory Management Topics
Contiguous Memory Allocation
Overview of Contiguous Allocation
Memory Layout Requirements
Allocation Strategies
Single-Partition Allocation
Bare-Machine Approach
No Protection or Relocation
Direct Hardware Access
Resident Monitor
OS in Reserved Memory
User Program in Remaining Memory
Memory Protection Mechanisms
Multiple-Partition Allocation
Fixed-Partition Scheme (MFT)
Partitioning Strategies
Equal-Size Partitions
Unequal-Size Partitions
Internal Fragmentation Issues
Partition Assignment Policies
Dynamic-Partition Scheme (MVT)
Variable Partition Sizes
External Fragmentation Issues
Partition Merging and Splitting
Dynamic Storage-Allocation Problem
Memory Allocation Algorithms
First-Fit Algorithm
Operation and Implementation
Time Complexity
Memory Utilization
Best-Fit Algorithm
Operation and Implementation
Time Complexity
Memory Utilization
Worst-Fit Algorithm
Operation and Implementation
Time Complexity
Memory Utilization
Next-Fit Algorithm
Comparison of Allocation Algorithms
Performance Metrics
Fragmentation Analysis
Fragmentation
Internal Fragmentation
Causes and Examples
Measurement Techniques
External Fragmentation
Causes and Examples
Measurement Techniques
Compaction as a Solution
Compaction Process
Memory Copying Operations
Address Update Requirements
Limitations and Overheads
Performance Impact
System Downtime
Previous
2. Address Spaces and Binding
Go to top
Next
4. Non-Contiguous Memory Allocation: Paging