Question

Which of the schedules in (a) results in minimal average waiting time (overall processes)? 

13 Sep 2024
Answer :
Word Count : 647

To determine which schedule results in minimal average waiting time for processes in an operating system, we need to evaluate various CPU scheduling algorithms. The average waiting time is calculated as the sum of the waiting times of all processes divided by the number of processes. Different algorithms approach process scheduling differently, resulting in varying waiting times. Let’s explore the common scheduling algorithms:

1. First-Come, First-Served (FCFS) Scheduling

  • Mechanism: Processes are scheduled in the order they arrive in the ready queue.
  • Advantages: Simple to implement and understand.
  • Disadvantages: Poor performance with processes of varying burst times. Leads to the "convoy effect," where a long process delays all subsequent shorter processes.

Example Calculation: For processes P1,P2,P3P1, P2, P3 with arrival times of 0 and burst times _________ __________ __________ __________ _____ ___ ____ ________ ______ ____.
____ _____ _______ __________ ____ ________ __________ ____.
___ _____ _______ _________ _________ ______ ______ ________ ___.
________ __________ _____ _______ _____ ______ ___ ________ _______ ______ _____.
________ ____ ____ _________ ___ _____ __________ __________ _________ ______ ____.
_____ _______ __________ ___ ___.
_________ __________ ________ ________ _______.
__________ ________ __________ ______ ________ _______ _________ ____ __________ _____.
________ _________ _____ _____ _______ ________ _______.
____ ______ _____ _____ ______ ________ _____ ________ _______.
___ ________ _____ _______ __________ __________ __________ _______ ______.
_____ ______ ___ ___ ________ ________.
_______ ______ ________ ___ ____ __________.
____ ________ _______ ________ _______.
__________ ___ ____ ___ __________ _________.
____ _____ _____ _______ ___ ________ __________ _________ _________ ___.
______ ________ _________ _____ _________ ___ ______ ____ ___ _________.
__________ _______ ______ ______ ______ ___ ______ ________.
_____ ___ ____ ______ ______ _______ __________ ___ _____ _________ ______ ______.
____ __________ ________ _______ ________.
__________ _________ ________ ____ _____ ________ ___ _____ ____.
_______ ____ ______ ________ ________ _________ ___ __________ ______.
________ __________ ____ ____ ___ ____ _______ _____ _________.
______ ________ ____ _________ _______ _____ _____ _________.
_____ ___ _________ ___ ___ ______ ____ __________.
__________ _________ ____ _________ ____ __________ _____ __________ _____ _______ ________ ____.
____ __________ ______ __________ _____.
___ _________ ________ ___ ___ ___.
_____ _____ __________ _________ ______ __________ ______ ____ __________ ________ _______ __________.
________ __________ ____ _______ _________.
__________ _________ _____ __________ ________ __________ ___ _________ _________ ________.
_______ _______ __________ __________ __________ _______ _______ ______.
___ __________ ____ _______ ____.
____ ___ ___ ___ ______ _________ _________ ________ ______ __________ _____ _______.
_____ ___ __________ ____ ___ ________ ________ _______ ________ ____.
_______ __________ ________ _________ ___ _________ _____ ________ _______ _____ ________.
______ ___ _________ ________ _______ ___ _________ _________ ____ ______ ______ ______.
____ _________ _________ ________ ____ ____ _________ _______ ______ ____ _______ _____.
_____ ______ __________ _____ _________ ___ ________.
_____ ___ ___ __________ ____ ____.
_______ _______ ________ __________ __________ ________ _______ _____ __________ _____.
____ __________ _________ __________ _____ ________.
_______ ________ _____ ______ __________ _________ _________ ______ ______ _________.
_______ _______ ________ _____ _____ _________ __________ ________ __________ ____.
_______ ______ __________ ___ ________ ________ ____ _________ _____ ____ _________ _________.
______ _______ _________ ___ ___ __________ _______ ___ _____ _______.
____ ________ _____ ______ ___ _____ ___ ___ ________ _____ ________ ________.
_______ _________ _______ _________ ______ ________ _________ _______.
______ _____ _________ _____ _________ _________ ____.
_____ _____ ___ ______ _________ _______ ________ ___.
______ _____ _________ ____ _______.
___ _______ _____ ______ _______ ________ ______.
________ ______ ______ ____ _______ __________.
_____ _______ _________ _________ ________ _________ ___ _______ ______ _______ _______ ___.
____ _____ ______ _______ __________ ___ ___ ________.
_____ ____ __________ __________ ________ ______ _____.
_________ ________ __________ _____ __________ ______ ___ ______ __________ ____ ___.
______ ___ ___ _________ _______ _____ _________.
_______ ______ ________ ________ _____ ______ ____ __________ ________ _____ _________.
__________ _________ _______ ___ ________ __________.
_________ ____ _____ __________ _________.
__________ _____.
Get Full Answer on WhatsApp

Related Questions

Write a program in C to implement Banker’s Algorithm to avoid Deadlock. Also explain the code briefly. 

Consider the following set of processes, with the length of the CPU burst time given in milliseconds.

Process Burst
time		 Priority
P1 8 3
P2 3 1
P3 4 4
P4 7 2
P5 6 5

The processes are assumed to have arrived in the order P1, P2, P3, P4 and P5 and

 all of them have arrived at time 0.

a. Draw corresponding Gantt charts illustrating the execution of these processes using FCFS, SJF, SRTN, Priority based scheduling/even-driven scheduling and Round Robin (quantum=2) scheduling algorithms.
b. What is the turnaround time of each process for each of the scheduling algorithm in (a)?
c. What is the waiting time of each process for each of the scheduling algorithm in (a)?
d. Which of the schedules in (a) results in minimal average waiting time (overall processes)? 

Discuss in detail the Process Management, Memory management, I/O management, File management and Security and Protection in WINDOWS 11 Operating System

FIFO replacement b. LRU replacement c. Optimal Mention the merits and demerits of each of the above algorithms. 

Write about the features of LuneOS. Also, discuss the process management, memory management and security management functions of LuneOS Mobile Operating System(GNU-General Public Licence

Consider the following set of processes, with the length of the CPU burst time given in milliseconds

 

   Process

      Burst  time           Priority
        P1                   8                      3
        P2                   3                      1
        P3                   4                      4
        P4                   7                     2
        P5                   6                     5

 

What is the turnaround time of each process for each of the scheduling algorithm in (a)?

IGNOU Solved Assignments Assignments Ignou Projects Project Previous Year Solved Exam Papers Notes Notes Sample Question Papers Sample Question Papers
Login Cart
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★
Top
📞
Call Support Instant phone assistance Which of the schedules in (a) results in minimal average waiting time
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→