16_Main_Memory_I

16_Main_Memory_I - CSC 4103 - Operating Systems Fall 2009...

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

View Full Document Right Arrow Icon
1 CSC 4103 - Operating Systems Fall 2009 Tevfik Ko ! ar Louisiana State University October 22 nd , 2009 Lecture - XVI Main Memory - I 2 Roadmap • Midterm Discussion • Project 1 Discussion • Main Memory Introduction Contiguous Allocation Dynamic Allocation Algorithms Fragmentation Address Binding Address Protection 3 ! The O/S must fit multiple processes in memory " memory needs to be subdivided to accommodate multiple processes " memory needs to be allocated to ensure a reasonable supply of ready processes so that the CPU is never idle Fitting processes into memory is like fitting boxes into a fixed amount of space " memory management is an optimization task under constraints Memory Management Requirements 12 Memory Allocation - contiguous • Fixed-partition allocation Divide memory into fixed-size partitions Each partition contains exactly one process The degree of multi programming is bound by the number of partitions When a process terminates, the partition becomes available for other processes # no longer in use OS process 5
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 10/01/2011 for the course CSC 4103 taught by Professor Ullmer,b during the Fall '08 term at LSU.

Page1 / 3

16_Main_Memory_I - CSC 4103 - Operating Systems Fall 2009...

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