Scribd
Upload
50 views1 page

Scheduling Algorithms

A process scheduler determines which processes are assigned to the CPU based on scheduling algorithms. The document discusses six common algorithms: first-come, first-served, shortest-job-next, priority, shortest remaining time, round robin, and multiple-level queues scheduling. These algorithms are either non-preemptive, where a running process runs to completion, or preemptive, where a higher priority process can interrupt a lower priority one.

Uploaded by

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

Scheduling Algorithms

A process scheduler determines which processes are assigned to the CPU based on scheduling algorithms. The document discusses six common algorithms: first-come, first-served, shortest-job-next, priority, shortest remaining time, round robin, and multiple-level queues scheduling. These algorithms are either non-preemptive, where a running process runs to completion, or preemptive, where a higher priority process can interrupt a lower priority one.

Uploaded by

Muhammad Usman Nasir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

A Process Scheduler schedules different processes to be assigned to the CPU based

on particular scheduling algorithms. There are six popular process scheduling


algorithms which we are going to discuss in this chapter −

 First-Come, First-Served (FCFS) Scheduling


 Shortest-Job-Next (SJN) Scheduling
 Priority Scheduling
 Shortest Remaining Time
 Round Robin(RR) Scheduling
 Multiple-Level Queues Scheduling
These algorithms are either non-preemptive or preemptive. Non-preemptive
algorithms are designed so that once a process enters the running state, it cannot be
preempted until it completes its allotted time, whereas the preemptive scheduling is
based on priority where a scheduler may preempt a low priority running process
anytime when a high priority process enters into a ready state.

You might also like