CS323: Case Study 3
Load the following jobs into memory using fixed partition following a certain memory allocation method (a. best-fit, b. first-fit, c. worst-fit).
Memory Block | Size |
Block 1 | 50K |
Block 2 | 200K |
Block 3 | 70K |
Block 4 | 115K |
Block 5 | 15K |
a. Job1 (100k) f. Job6 (6k)
turnaround: 3 turnaround: 1
b. Job2 (10k) g. Job7 (25k)
turnaround: 1 turnaround: 1
c. Job3 (35k) h. Job8 (55k)
turnaround: 2 turnaround: 2
d. Job4 (15k) i. Job9 (88k)
turnaround: 1 turnaround: 3
e. Job5 (23k) j. Job10 (100k)
turnaround: 2 turnaround: 3
*turnaround – how long it will stay in the memory.
Instructions:
Resources: http://anev11.blogspot.com/2011/01/os-case-study-5.html
No comments:
Post a Comment