Please enable JavaScript.
Coggle requires JavaScript to display documents.
Scheduler (Round Robin (Each process gets a small unit of CPU time,…
Scheduler
Round Robin
-
-
After the time has elapsed, the process is preempted and added to the end of the ready queue
If there are n processes in the ready queue and the time quantum is q, then each process gets 1/n of the CPU time in chunks of at most q time units at once.
-
-
-
Definitions
-
-
-
-
Response time – amount of time it takes from when a request was submitted until the first response is produced, not output
-
-
-
-
-
Scheduling Algorithm
First-Come, First-Served (FCFS)
-
-
-
Threads
When threads supported, threads scheduled, not processes
-
Balance Load
Push migration – periodic task checks load on each processor, and if found pushes task from overloaded CPU to other CPUs
-
-
Linux Scheduling
-
Scheduling classes
-
-
Rather than quantum based on fixed time allotments, based on proportion of CPU time
2 scheduling classes included, others can be added
-
-
-