



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
An in-depth exploration of cpu scheduling in multi-core computing, covering objectives, scheduling, scheduling criteria, and algorithms such as first come first serve (fcfs), shortest job first (sjf), and preemptive sjf. It also discusses priority scheduling and its combination with sjf.
Typology: Slides
1 / 7
This page cannot be seen from the preview
Don't miss anything!
Scheduling Traditional Real time Multi-processor Synchronization and synchronization objects Inter-process communication Security
To hide the effects of I/O Bursts and achieve higher CPU utilization To give a fair chance to all processes Short term scheduling CPU scheduling Long term scheduling Process admission policies Medium term scheduling Swap management
CPU Utilization (System centric) Keep CPU as much busy as possible Throughput (System centric) Number of processes completed/time Turnaround time (Process centric) Real time taken to complete a process Waiting time (Process centric) How much time a process is in ready queue Response time (Process centric) Factor for an interactive process Deadline (Real time behavior) Time guarantee to schedule a task.
First Come First Serve (FCFS) Simplest implementation No preemption Shortest Job First (SJF) Optimal scheduling algorithm Minimum Average Waiting Time Difficulty: To know the time that it will take Batch systems: A good choice.
Process Arrival Time CPU Burst Wait Time Turnaround P1 0 6 0 6 P2 4 20 2 22 P3 5 1 21 22
Process Arrival Time CPU Burst Wait Time Turnaround P1 0 6 0 6 P2 4 20 3 23 P3 5 1 1 2
When a new task arrives, the SJF is evaluated again and rescheduling can take place. aka Shortest-remaining-time-first (SRTF) scheduling
Simplest form is to add priority to a process. Select the highest priority job first Apply SJF/SRTF/FIFO/… scheduling only within a group of processes with the same priority