1 / 9

'Understanding CPU Scheduling Fundamentals'

CPU scheduling is crucial in multiprogrammed systems, improving computer productivity by switching among processes efficiently. Learn about CPU bursts, schedulers, dispatchers, scheduling criteria, and popular algorithms including First-Come, First-Served, Shortest-Job-First, and Priority.

hazelo
Download Presentation

'Understanding CPU Scheduling Fundamentals'

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CPU SCHEDULING

  2. INTRODUCTION CPU scheduling is the basis of multiprogrammed operating system. By switching the CPU among processes, the operating system can make the computer more productive

  3. CPU – I/O Burst Cycle CPU Scheduler Preemptive / Nonpreemptive Scheduling

  4. DISPATCHER • Switching context • Switching to user mode • Jumping to the proper location in the user program to restart that program

  5. Scheduling Criteria • CPU utilization • Throughput • Turnaround time • Waiting time • Response time

  6. SCHEDULING ALGORITHMS • First-Come , First-Served Scheduling Gantt chart: 24 27 30 0 Average waiting time: (0+24+27)/3 =17

  7. Shortest-Job-First Scheduling Gantt chart: 0 3 9 16 24 Average waiting time: (3+16+9+0) / 4 = 7

  8. Priority Scheduling Gantt chart: 0 1 6 16 18 19

  9. Waiting Time: P1 = 6 P2 = 0 P3 = 16 P4 = 18 P5 = 1 Average waiting time: 8.2 milliseconds

More Related