1. Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use scheduling, and base all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time P1 0 8 P2 4 4 P3 10 1 a. Draw the Gantt chart for the above using FCFS scheduling algorithm b. Draw the Gantt chart for the above using SJF non-preemptive scheduling algorithm. c. What is the average waiting time for these processes with the FCFS scheduling and SJF non-preemptive algorithms? d. What are the 2 major activities of an operating system with regards to process management? e. Which of the following instructions should be privileged? Read the clock. Clear memory. f. What is the purpose of system calls? 2. Consider the following set of processes, with the length of the CPU burst given in milliseconds. Process Burst Time Priority P1 2 2 P2 1 1 P3 8 4 The processes are assumed to have arrived in the order of P1, P2, P3, P4, P5 all at time 0. a. Draw the Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: preemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2). b. What is the turnaround time of each process for each of the scheduling algorithms in part i? c. Which of the algorithms results in the minimum average waiting time (over all processes)?
1. Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use scheduling, and base all decisions on the information you have at the time the decision must be made.
Process Arrival Time Burst Time
P1 0 8
P2 4 4
P3 10 1
a. Draw the Gantt chart for the above using FCFS scheduling
b. Draw the Gantt chart for the above using SJF non-preemptive scheduling algorithm.
c. What is the average waiting time for these processes with the FCFS scheduling and SJF non-preemptive algorithms?
d. What are the 2 major activities of an
Read the clock.
Clear memory.
f. What is the purpose of system calls?
2. Consider the following set of processes, with the length of the CPU burst given in milliseconds.
Process Burst Time Priority
P1 2 2
P2 1 1
P3 8 4
The processes are assumed to have arrived in the order of P1, P2, P3, P4, P5 all at time 0.
a. Draw the Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: preemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2).
b. What is the turnaround time of each process for each of the scheduling algorithms in part i?
c. Which of the algorithms results in the minimum average waiting time (over all processes)?
Step by step
Solved in 3 steps with 2 images
