Documente Academic
Documente Profesional
Documente Cultură
MEMORY MANAGEMENT
Introduction
2
Execution of Programs
6
executed
Stack
LIFO allocation
A `contiguous data structure
Used for data allocated `automatically on entering a block
Heap
pop)
Relocation
13
sensitive
Memory Protection
14
15
Two approaches:
Paging
Segmentation
20
Paging
21
Paging (continued)
22
Paging (continued)
Notation used to describe address translation:
s Size of a page
ll Length of a logical address (i.e., number of bits in it)
lp Length of a physical address
nb Number of bits used to represent the byte number in a logical address
np Number of bits used to represent the page number in a logical address
nf Number of bits used to represent frame number in a physical address
logical address
23
212 = 4KB
Segmentation
25
Reuse of Memory
27
Reuse of Memory
28
Memory Fragmentation
31
Boundary tags
Memory compaction
performed
35
Power-of-2 Allocator
38
different sizes
Each block contains a header element
with paging
1)
2)
3)
McKusickKarels allocator
Lazy buddy allocator
Slab allocator
object
Summary
43