Fichas
Scheduling algorithms
Fichas del conjunto (5)
- 1Round RobinEach process is given a fixed time to execute.
- 2First come first servedThe first process to arrive is the first executed.
- 3Multi-level feedback queuesMake use of existing algorithms. Each queue can have its own scheduling algorithm.
- 4Shortest job firstExecutes the job that takes the least time first.
- 5Shortest remaining timeProcessor is allocated the job that has the least time to complete. Can be preempted by a newer job that has less time to complete.
Información
- Descripción
- AS level Computing Fichas sobre Scheduling algorithms, creado por Toby Woodhead el 08/05/2017.
- Creado por
- Toby Woodhead
- Visitas
- 18
- Valoración