Friday, January 8, 2010

II. Memory Utilization Problem

1. Give the Following Information:

Table A1

Job List

Job Number

Memory Requested

J1

700K

J2

500K

J3

740K

J4

850K

J5

610K

 

 

 




 A. Best – Fit Algorithm



Memory Block

Memory Block Size

Job

Job Size

Internal Fragmentation

1132

700KB

J1

700KB

0

1003

720 KB

J5

610KB

110KB

1114

800 KB

J3

740KB

60KB

2310

750KB

1755

610KB

J2

500KB

110K

 

 

 

 

 

 

 

B. First – Fit Algorithm

Memory Block

Memory Block Size

Job

Job Size

Internal Fragmentation

1132

700KB

J1

700KB

0KB

1003

720 KB

J2

500KB

220KB

1114

800 KB

J3

740KB

60KB

2310

750KB

J5

610KB

140K

1755

610KB

 

 

 

 

 

 

 

C. Next – Fit Algorithm



Memory Block

Memory Block Size

Job

Job Size

Internal Fragmentation

1132

700KB

1003

720 KB

J5

610KB

140KB

1114

800 KB

J3

740KB

60KB

2310

750KB

J1

700KB

50KB

1755

610KB

J2

500KB

110KB







 

D. Worst – Fit Algorithm

 



Memory Block

Memory Block Size

Job

Job Size

Internal Fragmentation

1132

700KB

1003

720 KB

J1

700KB

200KB

1114

800 KB

J2

500KB

300KB

2310

750KB

J5

610KB

140KB

1755

610KB

No comments:

Post a Comment

Followers