Scribd
Upload
7 views2 pages

CPU Scheduling Algorithms CS3451

The document outlines various CPU scheduling algorithms used in operating systems, including First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Priority Scheduling, Multilevel Queue Scheduling, and Multilevel Feedback Queue (MLFQ). Each algorithm is described with its type, order of execution, advantages, and disadvantages. Additionally, it provides formulas for calculating turnaround time and waiting time.

Uploaded by

marianu6374
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views2 pages

CPU Scheduling Algorithms CS3451

The document outlines various CPU scheduling algorithms used in operating systems, including First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Priority Scheduling, Multilevel Queue Scheduling, and Multilevel Feedback Queue (MLFQ). Each algorithm is described with its type, order of execution, advantages, and disadvantages. Additionally, it provides formulas for calculating turnaround time and waiting time.

Uploaded by

marianu6374
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

CPU SCHEDULING ALGORITHMS - CS3451 (Operating Systems)

1. First Come First Serve (FCFS)

- Type: Non-preemptive

- Order: Processes executed in the order they arrive

- Advantages: Simple, easy to implement.

- Disadvantages: Convoy effect, poor for time-sharing.

2. Shortest Job First (SJF)

- Type: Non-preemptive / Preemptive (SRTF)

- Order: Shortest burst time first

- Advantages: Minimizes average waiting time.

- Disadvantages: Requires future knowledge, starvation possible.

3. Round Robin (RR)

- Type: Preemptive

- Time Quantum: Fixed time slice

- Advantages: Good for time-sharing, fair

- Disadvantages: High overhead if quantum is too small

4. Priority Scheduling

- Type: Preemptive / Non-preemptive

- Order: Based on priority (lower number = higher priority)

- Advantages: Important tasks get CPU early

- Disadvantages: Starvation possible, solved by aging

5. Multilevel Queue Scheduling


- Type: Static multiple queues (e.g., System: RR, User: FCFS)

- Processes fixed to queues

6. Multilevel Feedback Queue (MLFQ)

- Type: Dynamic, processes can move between queues

- Advantages: Flexible, adapts to behavior

- Disadvantages: Complex

Formulas:

- Turnaround Time (TAT) = Completion Time - Arrival Time

- Waiting Time (WT) = Turnaround Time - Burst Time

- Average TAT/WT = Sum of TATs / WTs ÷ Number of Processes

You might also like