Scribd
Upload
6 views

CPU Scheduling Algorithms

Uploaded by

Jyoti Bali
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
6 views

CPU Scheduling Algorithms

Uploaded by

Jyoti Bali
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
You are on page 1/ 3

CPU Scheduling Algorithms:

Understanding CPU Scheduling

• What is CPU Scheduling?

o The process of deciding which process to execute next on a single CPU system.

o Goal: Maximize CPU utilization and minimize average waiting time.

Common CPU Scheduling Algorithms

1. First-Come-First-Served (FCFS)
2. Shortest Job First (SJF)
3. Priority Scheduling
4. Round Robin (RR)
5. Shortest Remaining Time First (SRTF)

First-Come-First-Served (FCFS)

o Processes are executed in the order they arrive.

o Simple but can lead to long waiting times for short processes.

o Visual: [Insert a visual of a queue with processes and their arrival/burst times]

o Timing Diagram: [Insert a timing diagram showing process execution and waiting
times]

Shortest Job First (SJF)

o The process with the shortest burst time is executed next.

o Optimal for minimizing average waiting time.

o Visual: [Insert a visual of a queue sorted by burst times]

o Timing Diagram: [Insert a timing diagram showing process execution and waiting
times]

Priority Scheduling

o Each process is assigned a priority, and the highest priority process is executed next.

o Can lead to starvation if low-priority processes never get executed.

o Visual: [Insert a visual of a queue sorted by priorities]

o Timing Diagram: [Insert a timing diagram showing process execution and waiting
times]
Round Robin (RR)

o Each process is given a fixed time quantum. If a process doesn't finish within its
quantum, it is preempted and placed at the end of the queue.

o Provides fair CPU time allocation to all processes.

o Visual: [Insert a visual of a circular queue]

o Timing Diagram: [Insert a timing diagram showing process execution and


preemptions]

Shortest Remaining Time First (SRTF)

o A preemptive version of SJF. The process with the shortest remaining burst time is
executed next.

o Visual: [Insert a visual of a queue sorted by remaining burst times]

o Timing Diagram: [Insert a timing diagram showing process execution and


preemptions]

Comparison of Algorithms

• Average Waiting Time: SJF and SRTF generally have the lowest average waiting time.

• Response Time: RR and SRTF offer better response times for interactive processes.

• Fairness: RR ensures fair CPU time allocation among all processes.

• Overhead: Priority scheduling and preemptive algorithms may have higher overhead due to
context switching.

Choosing the Right Algorithm The best algorithm depends on the specific requirements of the
system, such as:

• Process characteristics: Short or long jobs, interactive or batch processes.

• System goals: Minimizing waiting time, maximizing throughput, or ensuring fairness.

• Overhead considerations: The cost of context switching and scheduling.

Additional Considerations
• Aging: Techniques to prevent starvation of low-priority processes.

• Multiple CPUs: Scheduling algorithms for multiprocessor systems.

• Real-time systems: Scheduling algorithms with guarantees for meeting deadlines.

By understanding these concepts and visualizing the algorithms, you can make informed decisions
about CPU scheduling in your systems.

You might also like