Dynamic Memory Allocation, Process Layout, Memory Allocation Algorithms Notes | EduRev

: Dynamic Memory Allocation, Process Layout, Memory Allocation Algorithms Notes | EduRev

 Page 1


Dynamic Memory Allocation 
Page 2


Dynamic Memory Allocation 
Agenda 
• Process Layout 
• Memory Allocation Algorithms 
• Garbage Collection Algorithms 
 
Reference: Ch. 5.7 and 8.5 
Page 3


Dynamic Memory Allocation 
Agenda 
• Process Layout 
• Memory Allocation Algorithms 
• Garbage Collection Algorithms 
 
Reference: Ch. 5.7 and 8.5 
Process Layout 
lower addresses 
higher addresses 
executable code 
(text) 
static data 
(e.g. globals) 
heap 
stack 
Page 4


Dynamic Memory Allocation 
Agenda 
• Process Layout 
• Memory Allocation Algorithms 
• Garbage Collection Algorithms 
 
Reference: Ch. 5.7 and 8.5 
Process Layout 
lower addresses 
higher addresses 
executable code 
(text) 
static data 
(e.g. globals) 
heap 
stack 
Process Layout 
lower addresses 
higher addresses 
executable code 
(text) 
static data 
(e.g. globals) 
heap 
stack 
valid 
addresses 
valid 
addresses 
Page 5


Dynamic Memory Allocation 
Agenda 
• Process Layout 
• Memory Allocation Algorithms 
• Garbage Collection Algorithms 
 
Reference: Ch. 5.7 and 8.5 
Process Layout 
lower addresses 
higher addresses 
executable code 
(text) 
static data 
(e.g. globals) 
heap 
stack 
Process Layout 
lower addresses 
higher addresses 
executable code 
(text) 
static data 
(e.g. globals) 
heap 
stack 
valid 
addresses 
valid 
addresses 
Process Layout 
lower addresses 
higher addresses 
executable code 
(text) 
static data 
(e.g. globals) 
heap 
stack 
valid 
addresses 
valid 
addresses 
rigid 
rigid 
changed with sbrk() 
changed by calling and 
returning from functions 
Read More
Offer running on EduRev: Apply code STAYHOME200 to get INR 200 off on our premium plan EduRev Infinity!