ikh311-08

371 views
346 views

Published on

Published in: Technology, Business
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
371
On SlideShare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
16
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

ikh311-08

  1. 1. Sistem Operasi IKH311 Job Scheduling 1
  2. 2. Scheduler Activations• Goal – mimic functionality of kernel threads – gain performance of user space threads• Avoids unnecessary user/kernel transitions• Kernel assigns virtual processors to each process – lets runtime system allocate threads to processors• Problem: Fundamental reliance on kernel (lower layer) calling procedures in user space (higher 2 layer)
  3. 3. Scheduling Introduction to Scheduling (1)• Bursts of CPU usage alternate with periods of I/O wait – a CPU-bound process 3 – an I/O bound process
  4. 4. Introduction to Scheduling (2) Scheduling Algorithm Goals 4
  5. 5. Scheduling in Batch Systems (1)An example of shortest job first scheduling 5
  6. 6. Scheduling in Batch Systems (2) Three level scheduling 6
  7. 7. Scheduling in Interactive Systems (1)• Round Robin Scheduling – list of runnable processes – list of runnable processes after B uses up its quantum 7
  8. 8. Scheduling in Interactive Systems (2)A scheduling algorithm with four priority classes 8

×