CSC 468 / CSC 2204

10/10/2002

CSC 468H1F / CSC 2204

Lecture 5: Memory Management Reading: Text, Chapter 7

10/10/2002

CSC 468 / CSC 2204

Reminders
n

Assignment #1 due now

n

TAs will take it up during Tuesdays tutorial

Nachos projects due next Friday Midterm 1 week from Tuesday (Oct 22)

10/10/2002

CSC 468 / CSC 2204

CSC 468 / CSC 2204

10/10/2002

Memory Management
n n

n n

Every active process needs memory CPU scheduling allows processes to share (multiplex) the processor Must figure out how to share main memory as well What should our goals be?
n n n n

Support enough active processes to keep CPU busy Use memory efficiently (minimize wasted memory) Keep memory management overhead small while satisfying five basic requirements

10/10/2002

CSC 468 / CSC 2204

Requirements
n

Relocation
n

Programmers dont know what physical memory will be available when their programs run Medium-term scheduler may swap processes in/out of memory, need to be able to bring it back in to a different region of memory This implies we will need some type of address translation A processs memory should be protected from unwanted access by other processes, both intentional and accidental Requires hardware support

Protection
n

10/10/2002

CSC 468 / CSC 2204

CSC 468 / CSC 2204

10/10/2002

More requirements
n

Sharing
n

In some instances, processes need to be able to access the same memory Need ways to specify and control what sharing is allowed Machine accesses/addresses memory as a one-dimensional array of bytes Programmers organize code in modules Need to map between these views Memory and Disk form a two-level hierarchy, flow of information between levels must be managed
CSC 468 / CSC 2204 5

Logical Organization
n

n n

Physical Organization
n

10/10/2002

Meeting the requirements

n

Modern systems use virtual memory

n

Complicated technique requiring hardware and software support Based on simpler techniques of segmentation and/or paging

Well build up to virtual memory by looking at some simpler schemes first

n n n n

Fixed partitioning Dynamic partitioning Paging Segmentation

n 10/10/2002

Well also look at loading and address translation

CSC 468 / CSC 2204 6

CSC 468 / CSC 2204

10/10/2002

Fixed Partitioning
n

Divide memory into regions with fixed boundaries

n

Operating system 8M Process 1 - 5M Available 8M Unusable - 3M Available 8M Process 2 - 2M Available 8M - 6M Unusable Available 8M
7

Can be equal-size or unequal-size

Operating system occupies one partition A single process can be loaded into each remaining partition
n

Memory is wasted if process is smaller than partition (internal fragmentation) Programmer must deal with programs that are larger than partition (overlays )
CSC 468 / CSC 2204

10/10/2002

Placement w/ Fixed Partitions

n n

Number of partitions determines number of active processes If all partitions are occupied by waiting processes, swap some out, bring others in Equal-sized partitions:
n

Process can be loaded into any available partition Queue-per-partition, assign process to smallest partition in which it will fit
n

Unequal-sized partitions:
n

A process always runs in the same size of partition

Single queue, assign process to smallest available partition

CSC 468 / CSC 2204 8

10/10/2002

CSC 468 / CSC 2204

10/10/2002

Placement Example
Program 1 and Program 2 fit in same partition. With smallest-partition policy, both must share 8M partition while 16M partition goes unused.
Process 1 - 5M Operating system 8M Available 4M Available 4M Available 8M

Process 2 - 7M

Available 16M

10/10/2002

CSC 468 / CSC 2204

Dynamic Partitioning
n n

Partitions vary in length and number over time When a process is brought in to memory, a partition of exactly the right size is created to hold it
Operating system 8M Process 1 - 5M Operating system 8M Process 1 - 5M Process 2 - 7M

Operating system 8M

Available 32M

Available 27M

Available 20M

10/10/2002

CSC 468 / CSC 2204

10

CSC 468 / CSC 2204

10/10/2002

More Dynamic Partitioning

n

As processes come and go, holes are created

n

Some blocks may be too small for any process This is called external fragmentation

Operating system 8M Process 1 - 5M Available - 7M Process 3 - 2M Available 18M

OS may move processes around to create larger chunks of free space

n

E.g. if Process 3 were allocated immediately following Process 1, we would have a 25M free partition This is called compaction
CSC 468 / CSC 2204

10/10/2002

11

Placement Algorithms
n n

Compaction is time-consuming We can reduce the need for it by being careful about how memory is allocated to processes over time Given multiple blocks of free memory of sufficient size, how should we choose which one to use?
n

Best-fit - choose the block that is closest in size to the request First-fit - scan memory from the beginning and choose first block that is large enough Next-fit - scan memory from location of last placement and choose first block that is large enough
CSC 468 / CSC 2204 12

10/10/2002

CSC 468 / CSC 2204

10/10/2002

Comparing Placement Algs.

n

Best-fit
n n

often worst performer in practice Guarantees left-over fragments will be as small as possible Simplest, and often fastest and most efficient May leave many small fragments near start of memory that must be searched repeatedly Tends to allocate from end of memory Free space becomes fragmented very rapidly

First-fit
n n

Next-fit
n n

10/10/2002

CSC 468 / CSC 2204

13

Relocation
n

Programmers cant know the physical memory their programs will use at run-time
n n n

Programmer uses symbolic addresses (e.g. variable names) Compiler/assembler translates these to logical addresses Loader translates logical addresses to physical addresses when program is loaded into memory

Swapping and compaction require a way to change the physical memory addresses a process refers to
n

Need dynamic relocation - process refers to relative addresses, hardware translates to physical address as instruction is executed
CSC 468 / CSC 2204 14

10/10/2002

CSC 468 / CSC 2204

10/10/2002

Hardware for Relocation

n

Basic idea: add relative address to process starting (base) address to form absolute, or physical, address
n

Also check that address generated is within processs space When process is assigned to CPU (i.e., set to Running state), load base register with starting address of process Load bound register with last address of process On memory reference instruction (load, store) add base to address and compare with bound If compare fails, trap to operating system
n

2 registers, base and bound

n

n n

Illegal address exception

CSC 468 / CSC 2204 15

10/10/2002

Problems with Partitioning

n

With fixed partitioning, internal fragmentation and need for overlays are big problems
n

Scheme is too inflexible

With dynamic partitioning, external fragmentation and managing the available space are major problems Basic problem is that processes must be allocated to contiguous blocks of physical memory
n

Hard to figure out how to size these blocks given that processes are not all the same

n 10/10/2002

Well look now at paging as a solution

CSC 468 / CSC 2204 16

CSC 468 / CSC 2204

10/10/2002

Paging
n

Partition memory into equal, fixed-size chunks

n

These are called page frames or simply frames

Divide processes memory into chunks of the same size

n

These are called pages External fragmentation is eliminated Internal fragmentation is at most a part of one page per process

Any page can be assigned to any free page frame

n n

Possible sizes are restricted to powers of 2 to simplify translation

CSC 468 / CSC 2204 17

10/10/2002

Example of Paging
0 1 2 3 4 5 6 7 8
n

Main memory A.0 A.1 A.2

C.0 C.1

0 1 2 3 4 5 6 7 8

Main memory A.0 A.1 A.2 D.1 D.2 C.0 C.1 D.3

We can fit Process D into memory, even though we dont have 3 contiguous frames available!
CSC 468 / CSC 2204 18

10/10/2002

CSC 468 / CSC 2204

10/10/2002

Support for Paging

n n

Need more than base & bound registers now Operating system maintains a page table for each process
n n n

Page table records which physical frame holds each page Logical addresses are now page number + page offset On each memory reference, processor translates page number to frame number and adds offset to generate a physical address Keep a page table base register to quickly locate the page table for the running process

10/10/2002

CSC 468 / CSC 2204

19

Example Address Translation

n

Suppose addresses are 16 bits, pages are 1024 bytes

n

Page#

478

Offset

n n

Least significant 10 bits of address provide offset within a page (210 = 1024) Most significant 6 bits provide page number Maximum number of pages = 26 = 64 Extract page number (mask high-order 6 bits) Get frame number from page table Combine frame number with page offset

Page# Frame#

To translate logical address:

n n n

0 1 2 3

11 16 7 28

Frame#
10/10/2002 CSC 468 / CSC 2204

28

478

Offset
20

10

CSC 468 / CSC 2204

10/10/2002

Segmentation
n n

Alternate means of dividing user program Divisions reflect logical organization of the program
n n

Text segment - read-only Data segment - read/write, may be subdivided further

Segments are variable-sized

n

n n

A lot like dynamic partitioning, but a process may occupy multiple, non-contiguous segments Suffers from external fragmentation No simple mapping from logical to physical addresses

10/10/2002

CSC 468 / CSC 2204

21

Address Translation
n

Operating system maintains a segment table

n

Like the page table, but records start address and length for each segment Physical start of segment need not be power-of-2

Logical addresses consist of a segment # and an offset within that segment

n

For translation, reserve a fixed number of high-order bits for segment number Maximum segment size is determined by the number of bits left for the offset. E.g., 16 bit address, 4 bit segment number = 16 segments of max size 4096 bytes (212 = 4096)
CSC 468 / CSC 2204 22

10/10/2002

11

CSC 468 / CSC 2204

10/10/2002

Example
Segment#

Offset

78

Segment#

0 1 2 3

Length

750 224 1020 100

510 1372 2128 340

Base

+
418

There is no longer a clean correspondence between logical and physical addresses

CSC 468 / CSC 2204

Address

10/10/2002

23

Next time
n

So far, we have managed a more efficient use of memory but still require that entire process be in physical memory when it executes
n

Supporting larger programs is the responsibility of the programmer via overlays

We would like to remove this restriction and have the system manage partially loaded processes
n

This is the job of virtual memory, which is the topic of next weeks lecture

10/10/2002

CSC 468 / CSC 2204

24

12