Basic policies for uniprocessor scheduling are First-Come-First-Serve (FCFS), Round-robin, Shortest Process Next (SPN) and Shortest Remaining...

  

Transcribed Image Text:

Basic policies for uniprocessor scheduling are First-Come-First-Serve (FCFS), Round-robin, Shortest Process Next (SPN) and Shortest Remaining Time (SRT) scheduling policies. Consider the following set of processes: Table 1: Process Scheduling Arrival Time Process Service Time A 0 3 B 2 5 C 4 5 D 6 2 E 8 3 Perform an analysis for the set of processes in Table 1 using Round-robin (q=4), and Shortest Remaining Time (SRT) scheduling policies performance. In your analysis for each scheduling policy, you are required to: a) Illustrate the execution pattern for each policy for one cycle. b) Count the finish time and turnaround time for each policy. c) Justify which policy has better result. Basic policies for uniprocessor scheduling are First-Come-First-Serve (FCFS), Round-robin, Shortest Process Next (SPN) and Shortest Remaining Time (SRT) scheduling policies. Consider the following set of processes: Table 1: Process Scheduling Arrival Time Process Service Time A 0 3 B 2 5 C 4 5 D 6 2 E 8 3 Perform an analysis for the set of processes in Table 1 using Round-robin (q=4), and Shortest Remaining Time (SRT) scheduling policies performance. In your analysis for each scheduling policy, you are required to: a) Illustrate the execution pattern for each policy for one cycle. b) Count the finish time and turnaround time for each policy. c) Justify which policy has better result.

Answer rating: 100% (QA)

Roundrobin q4 scheduling a Execution pattern for one cycle Time Process 04 A 48 B 810 C 1012 D 1216 ... View the full answer