Due Date
Beginning of class
Tuesday, April 8th, 2014
Homework Assignment 8
Silberschatz et al, Operating System Concepts,
8th edition, Chapter 8, Main Memory
Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and
600 KB (in order), how would each of the first-fit, best-fit, and worst-fit
algorithms place processes of 426 KB, 417 KB, 212 KB, and 112 KB (in
order)?Which algorithm makes the most efficient use of memory?
Assuming a 1 KB page size, what are the page numbers and offsets for
the following address references (provided as decimal numbers):
2375
19566
30000
256
16385
Consider the following segment table:
Segment
Base
Length
0
219
600
1
2300
14
2
90
100
3
1327
580
4
1952
96
What are the physical addresses for the following logical addresses?