Please enable JavaScript.
Coggle requires JavaScript to display documents.
CPU Scheduling, Multi-processor Scheduling, Algorithm Evaluation,…
CPU Scheduling
Shortest Job First
-
-
Estimation algorithm T(n+1) = alpha t(n) + (1 - alpha) T(n), T is predicted, t is actual, alpha is usually 0.5
-
-
RoundRobin
-
Must select a properly sized quantum, a too big quantum will cause FIFO, and a too small will cause too many context switch
Typically has higher turnaround than SJF but better responses since no process takes hold of the CPU
Multilevel Queue
Ready queue is partitioned into separate queues, each process permanently belongs to one, each queue has a scheduling algorithm
-
-
-
-
-
Algorithm Evaluation
-
-
-
Implementation
Allow the OS to use each algorithm on its own for a period of time, and then based on the results will determine what to go with forever
-
-
-