Question

In: Computer Science

What are the three types of processor scheduling? What is the difference between turnaround time and...

What are the three types of processor scheduling?

What is the difference between turnaround time and response time?

What is the difference between preemptive and non-preemptive scheduling?

Is a non-preemptive scheduling approach a good choice for interactive systems? Why?

What is the meaning of the term: feedback scheduling?

Solutions

Expert Solution

ANSWERS :

ANS 1. The 3 types of processor scheduler are :

a) Long term - also called job scheduler. It mainly offers a mix variety of jobs.

b) Short term - also called CPU scheduler. It mainly increases the system performance.

c) Medium term - also called swapping scheduler. It offers maximum speed among all the scheduler.

ANS 2. Difference between turnaround time and response time :

- Turnaround time is the time between the submission of job to the completion of the job.

- The Response time is the time between the submission to the first response.

  

ANS 3. Difference between preemptive and non-preemptive scheduling :

- Preemptive scheduling is the one in which the CPU preempt a low priority process whenever a high priority process comes into the queue or in the ready state. CPU is allocated to the process for a certain amount of time

- Non- preemptive scheduling is the one in which a process cannot be preempted until and unless it is completed. CPU is allocated to the process until it end's .

ANS 4. No, a non- preemptive scheduling is not a good approach for interactive systems .

This is because usually interactive systems uses round robin scheduling that is a type of preemptive scheduling. As it poses many Benifits that includes :

- improves the average response time.

- There is no starvation for any process.

- there is fair allocation of CPU to all the process.

These all Benifits are provided by only preemptive scheduling so this non preemptive will not provide these benifits and thus is not a good approach.

ANS 5. Feedback Scheduling : in this Scheduling the processes can move in between the queues. It is flexible and the benefit of this scheduling is mostly that in this different processes are separated with respect to the CPU burst time. This scheduling reduces the aging and starvation problem to large extent.


Related Solutions

What is the waiting time and Turnaround time of each process for each of the scheduling...
What is the waiting time and Turnaround time of each process for each of the scheduling algorithms? [12 Marks] Job Arrival Time Burst(msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold) (a) First-Come-First-Served (FCFS) scheduling [2 Marks] (b) Preemptive PRIORITY scheduling [2 Marks] (c) Highest Response Ratio Next (HRRN) scheduling [2 Marks] (d) Round Robin (RR) (quantum = 4) scheduling [2 Marks]...
What is the waiting time and Turnaround time of each process for each of the scheduling...
What is the waiting time and Turnaround time of each process for each of the scheduling algorithms? [12 Marks] Job Arrival Time Burst(msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold) (a) First-Come-First-Served (FCFS) scheduling [2 Marks] (b) Preemptive PRIORITY scheduling [2 Marks] (c) Highest Response Ratio Next (HRRN) scheduling [2 Marks] (d) Round Robin (RR) (quantum = 4) scheduling [2 Marks]...
What is the waiting time and Turnaround time of each process for each of the scheduling...
What is the waiting time and Turnaround time of each process for each of the scheduling algorithms? [12 Marks] Job Arrival Time Burst(msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold) (a) First-Come-First-Served (FCFS) scheduling [2 Marks] (b) Preemptive PRIORITY scheduling [2 Marks] (c) Highest Response Ratio Next (HRRN) scheduling [2 Marks] (d) Round Robin (RR) (quantum = 4) scheduling [2 Marks]...
What is the waiting time and Turnaround time of each process for each of the scheduling...
What is the waiting time and Turnaround time of each process for each of the scheduling algorithms? Job Arrival Time Burst(msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold) (a) First-Come-First-Served (FCFS) scheduling. (b) Preemptive PRIORITY scheduling . (c) Highest Response Ratio Next (HRRN) scheduling. (d) Round Robin (RR) (quantum = 4) scheduling. (e) Which of the foregoing scheduling policies provides the...
What is the waiting time and Turnaround time of each process for each of the scheduling...
What is the waiting time and Turnaround time of each process for each of the scheduling algorithms? [12 Marks] Job Arrival Time Burst(msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold) (a) First-Come-First-Served (FCFS) scheduling [2 Marks] (b) Preemptive PRIORITY scheduling [2 Marks] (c) Highest Response Ratio Next (HRRN) scheduling [2 Marks] (d) Round Robin (RR) (quantum = 4) scheduling [2 Marks]...
What is the waiting time and Turnaround time of each process for each of the scheduling...
What is the waiting time and Turnaround time of each process for each of the scheduling algorithms? [12 Marks] Job Arrival Time Burst(msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold) (a) First-Come-First-Served (FCFS) scheduling [2 Marks] (b) Preemptive PRIORITY scheduling [2 Marks] (c) Highest Response Ratio Next (HRRN) scheduling (d) Round Robin (RR) (quantum = 4) scheduling (e) Which of the...
For Priority Scheduling, What is the arrival time, completion time, burst time, turnaround time, and the...
For Priority Scheduling, What is the arrival time, completion time, burst time, turnaround time, and the waiting time? discuss these terms further as they pertain to the efficiency of the algorithm as well as properties such as starvation. Pros and Cons of Priority Scheduling
For Round Robin (RR) Scheduling, What is the arrival time, completion time, burst time, turnaround time,...
For Round Robin (RR) Scheduling, What is the arrival time, completion time, burst time, turnaround time, and the waiting time? discuss these terms further as they pertain to the efficiency of the algorithm as well as properties such as starvation. Pros and Cons of RR
For Multiple-Level Queues Scheduling, What is the arrival time, completion time, burst time, turnaround time, and...
For Multiple-Level Queues Scheduling, What is the arrival time, completion time, burst time, turnaround time, and the waiting time? discuss these terms further as they pertain to the efficiency of the algorithm as well as properties such as starvation. Pros and Cons of Multiple-Level Queues Scheduling
For Shortest-Job-Next (SJN) Scheduling, -What is the arrival time, completion time, burst time, turnaround time, and...
For Shortest-Job-Next (SJN) Scheduling, -What is the arrival time, completion time, burst time, turnaround time, and the waiting time? -discuss these terms further as they pertain to the efficiency of the algorithm as well as properties such as starvation. -Pros and Cons of SJN
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT