Unformatted text preview: Score: Name:
ECE 3055 Quiz — April 7, 2004
The following processes arrive for execution at the times indicated. Use preemptive scheduling for SRTF
and RR. Base all decisions on the information you have at the time the decision is made. At arrival time,
the burst execution time is known. For RR, assume a newly arrived process is in the ready queue just prior to its arrival time (i.e. it is in the ready queue just before a running process is stopped and added to tail of
the ready queue at a time slice.) Process Arrival Time CPU Burst or Execution Time P1 0.0ms 41115 p2 2.0ms 3ms TT_ u+g+c+€= 5'15"
P3 4.01m 3ms -' T'- P4 6.0ms 2ms [MT 9&1 = 1.15 Draw a Gantt chart using FCFS: f. i P\ P i
0 l 2 3 4 5 6 7 8 71-9: 41315;: 12 Draw a Gantt chart using SJF (no preemption): If it” —-P 0 l 3 4 5 6 7 8 9 10 11 12 Draw a Gantt chart using SRTF: Fill in the table below: Avera e Turnaround Time Avera e Wait Time ' Lt FCFS 51-5 '2 .lg
SJF S i I __ (no preemption) SRTF g 1—_ (preemption) RR c5 35 ...
View Full Document
- Spring '08