Day 11-1 - 11/1/11 Memory Allocation and Usage Keeping...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
11/1/11 Memory Allocation and Usage Keeping Track of Free Blocks o Method 1: Implicit list using lengths – links all blocks (DID ALREADY) o Method 2: Explicit list among the free blocks using pointers within the free blocks o Method 3: Segregated free lists Different free lists for different size classes o Method 4: Blocks sorted by size Can use a balanced tree with pointers within each free block Explicit Free Lists Use data space for link pointers o Typically doubly linked o Still need boundary tags for coalescing o It is important to realize that links are not necessarily in the same order as the blocks Allocating from explicit free lists o Split a free block o You still have a smaller free block o Must correct the predecessor and successor pointers readjusted to the new locations Freeing with Explicit Free Lists o Where in the free list do you put a newly freed block? LIFO (last in first out) policy
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/05/2011 for the course ENGINEERIN 131 taught by Professor Cytron during the Spring '11 term at Washington University in St. Louis.

Page1 / 2

Day 11-1 - 11/1/11 Memory Allocation and Usage Keeping...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online