Chapter 4-Extra Exercise
2
Arrival Time CPU 7. Given the following information: Draw a timeline for each of the following scheduling algorithms. (It may be helpful to first compute a start and finish time for each job.) a. FCFS b. SJN c. SRT d. Round robin (using a time quantum of 5, ignore context switching and natural wait) 8. Using the same information from Exercise 7, calculate which jobs will have arrived ready for processing by the time the first job is finished or interrupted using each of the following scheduling algorithms. a. FCFS b. SJN c. SRT d. Round robin (using a time quantum of 5, ignore context switching and natural wait) 9. Using the same information given for Exercise 7, compute the waiting time and turnaround time for every job for each of the following scheduling algorithms (ignoring context switching overhead). a. FCFS b. SJN c. SRT d. Round robin (using a time quantum of 2)
-
Upload
justin-gan-jit-fook -
Category
Documents
-
view
85 -
download
0
description
...
Transcript of Chapter 4-Extra Exercise
7. Given the following information:
Draw a timeline for each of the following scheduling algorithms. (It may be helpful to first compute a start and finish time for each job.)a. FCFSb. SJNc. SRTd. Round robin (using a time quantum of 5, ignore context switching and natural wait)8. Using the same information from Exercise 7, calculate which jobs will have arrived ready for processing by the time the first job is finished or interrupted using each of the following scheduling algorithms.a. FCFSb. SJNc. SRTd. Round robin (using a time quantum of 5, ignore context switching and natural wait)9. Using the same information given for Exercise 7, compute the waiting time and turnaround time for every job for each of the following scheduling algorithms (ignoring context switching overhead).a. FCFSb. SJNc. SRTd. Round robin (using a time quantum of 2)
