Course: Operating system

Answers of Chapter(8)
8.1 Explain the difference between internal and external fragmentation.

Answer:
The main deference is the allocation operation
 External fragmentation: memory space is NOT allocated and unused
 Internal Fragmentation: memory space is allocated and unused

****

8.16 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 212 KB, 417 KB, 112 KB, and 426 KB (in order)?Which algorithm
makes the most efficient use of memory?

Answer:

Let p1, p2, p3 & p4 are the names of the processes

a. First-fit:
 P1>>> 100, 500, 200, 300, 600
 P2>>> 100, 288, 200, 300, 600
 P3>>> 100, 288, 200, 300, 183
 100, 116, 200, 300, 183 <<<<< final set of hole
 P4 (426K) must wait

b. Best-fit:
 P1>>> 100, 500, 200, 300, 600
 P2>>> 100, 500, 200, 88, 600
 P3>>> 100, 83, 200, 88, 600
 P4>>> 100, 83, 88, 88, 600
 100, 83, 88, 88, 174 <<<<< final set of hole

c. Worst-fit:
 P1>>> 100, 500, 200, 300, 600
 P2>>> 100, 500, 200, 300, 388
 P3>>> 100, 83, 200, 300, 388
 100, 83, 200, 300, 276 <<<<< final set of hole
 P4 (426K) must wait

In this example, Best-fit turns out to be the best because there is no wait processes.
****

1
))‫ال تنسينا من صالح دعائك‬.....‫((أخيتي‬
Course: Operating system

8.14 Consider a logical address space of 64 pages of 1024 words each, mapped onto a
physical memory of 32 frames.
a. How many bits are there in the logical address?
b. How many bits are there in the physical address?

Answer:
Method1:
a) m =???
Size of logical address space = 2m = # of pages × page size
2m = 64 × 1024
2m = 26 × 210
2m =216 »» m=16 bit

Method2:
m =???
# of pages = 2m-n
n =???
Page size=2n
1024=2n
210=2n »» n=10 bit
Again: # of pages = 2m-n
64=2m-10
26=2m-10
6= m-10 »» m=16 bit

b)
Let (x) is number of bits in the physical address
x =???
Size of physical address space = 2x
Size of physical address space = # of frames × frame size
(frame size = page size )
Size of physical address space = 32 × 1024
2x =25 × 210
2x = 215
»» number of required bits in the physical address=x =15 bit

****
8.22 Consider a logical address space of 32 pages of 1024 words per page, mapped
onto a physical memory of 16 frames.
a. How many bits are required in the logical address?
b. How many bits are required in the physical address?

Answer:
a) m =???
Size of logical address space = 2m = # of pages × page size
= 32 × 1024 = 215 »» m=15 bit

2
))‫ال تنسينا من صالح دعائك‬.....‫((أخيتي‬
 Course: Operating system

b) Size of physical address space = # of frames × frame size

(frame size = page size )

Size of physical address space = 16 × 1024 = 214

»» number of required bits in the physical address =14 bit

****
8.19 Assuming a 1-KB page size , What are the page numbers and offsets for the
following address references (provided as decimal numbers)

a. 2375 d. 256

b. 19366 e. 16385

c. 30000

Answer:
Page size =2n =1024 B= 210 B
# of bits in offset part (n) =10

Solution steps :
1. Convert logical address: Decimal  Binary
2. Split binary address to 2 parts (page # , Offset), offset : n digits
3. Convert offset & page# : Binary Decimal

Logical Page # Offset

Logical address Page # Offset
address (6 bits) (10 bits)
(binary) (decimal) (decimal)
(decimal) (binary) (binary)
2375 0000 1001 0100 0111 0000 10 01 0100 0111 2 327
19366 0100 1011 1010 0110 0100 10 11 1010 0110 18 934
30000 0111 0101 0011 0000 0111 01 01 0011 0000 29 304
256 0000 0001 0000 0000 0000 00 01 0000 0000 0 256
16385 0100 0000 0000 0001 0100 00 00 0000 0001 16 1

****
8.10 Consider a paging system with the page table stored in memory.
a. If a memory reference takes 200 nanoseconds, how long does a paged memory
reference take?
b. If we add associative registers, and 75 percent of all page-table references are found
in the associative registers, what is the effective memory reference time? (Assume
that finding a page-table entry in the associative registers takes zero time, if the entry
is there.)

3
))‫ال تنسينا من صالح دعائك‬.....‫((أخيتي‬
Course: Operating system

Answer:
a. memory reference time= 200+200= 400 ns
( 200 ns to access the page table in RAM and 200 ns to access the word in memory)

b.
Case (1) : page entry found in associative registers (part1)
Memory access time = 0+200=200 ns
( 0 ns to access the page table in associative registers and 200 ns to access the word in
memory)

Case (2) : page entry NOT found in associative registers (part1) but found in page
table in RAM
Memory access time = 0+200+200=400 ns
( 0 ns to access the page table in associative registers (part1) ,200 ns to access the
page table(part2) in RAM and 200 ns to access the word in memory)

>>> Effective access time =∑ [probability of the case × access time of this case]
Effective access time = [0.75 × 200 ]+ [0.25 × 400]= 250 ns.

****
8.18 Consider a computer system with a 32-bit logical address and 4-KB page size .
The system supports up to 512MB of physical memory. How many entries are there
in each of the following:
a. A conventional single-level page table

Answer:
a) # of pages= # of entries =????
Size of logical address space = 2m = # of pages × page size
»» 232 = # of pages × 212
# of pages =232 / 212= 220 pages

*****

4
))‫ال تنسينا من صالح دعائك‬.....‫((أخيتي‬
Course: Operating system

8.21 Consider the following segment table:

Segment Base Length

0 219 600
1 2300 14
2 90 100 >> there is a typing error in this row in book
3 1327 580
4 1952 96

What are the physical addresses for the following logical addresses?
a. 0,430
b. 1,10
c. 2,500
d. 3,400
e. 4,112

Answer:
a. (430 < 600)>>>>> 219 + 430 = 649
b. (10 < 14)>>>>> 2300 + 10 = 2310
c. (500 not < 100)>>>>> illegal reference, trap to operating system
d. (400 < 580)>>>>> 1327 + 400 = 1727
e. (112 not < 96)>>>>> illegal reference, trap to operating system

****

8.17 Describe a mechanism by which one segment could belong to the address space
of two different processes.

Answer: Since segment tables are a collection of base–limit registers, segments can
be shared when entries in the segment table of two different jobs point to the same
physical location. The two segment tables must have identical base and limit values.

****

5
))‫ال تنسينا من صالح دعائك‬.....‫((أخيتي‬
 Course: Operating system

8.2 Compare the main memory organization schemes of contiguous-memory

allocation, pure segmentation, and pure paging with respect to the following issues:
a. external fragmentation
b. internal fragmentation
c. ability to share code across processes

Answer:
Internal ability to share
Method External fragmentation
fragmentation code
contiguous- There is external fragmentation (as There is no
memory address spaces are allocated internal
allocation contiguously and holes develop as fragmentation
(variable size finished processes release its space
method) and new processes are allocated
and the size of the new process is It does not
almost smaller than the old one) allow processes
contiguous- There is no external fragmentation There is internal to share code.
memory fragmentation
allocation (the size of the
(fixed size partition is
partition almost bigger
method) than the
process’s size)
pure paging There is no external fragmentation There is internal Able to share
fragmentation code between
(it appears in processes
the last frame
because the
process size
almost not a
multiplex of
page size )
pure There is external fragmentation There is no Able to share
segmentation (fragmentation would occur as internal code between
segments of finished processes are fragmentation processes
replaced by segments of new
processes.
and the size of the new process is
almost smaller than the old one)

****

Good Luck

Reem Al_Salih

6
))‫ال تنسينا من صالح دعائك‬.....‫((أخيتي‬
Course: Operating system

IMPORTANT NOTE:

Paging arithmetic laws:

Page size = frame size
Logical address space (/size) = 2m
Physical address space (/size) = 2x (where x is the number of bits in physical address)
Logical address space (/size) = # of pages × page size
Physical address space (/size) = # of frames × frame size
Page size= frame size= 2n
# of pages= 2m-n
# of entries (records)in page table = # of pages

7
))‫ال تنسينا من صالح دعائك‬.....‫((أخيتي‬