Fichas
Scheduling
Fichas del conjunto (6)
- 1What is a schedularIt uses a scheduling algorithm to determine how to share processor time.
- 2Round RobinEach process is given a fixed amount of time. If it hasn't finished by the end of that time period, it goes back to the end of the queue so the next process in line can have its turn
- 3First Come, First ServedJust like queuing in a shop, The first process that arrives is processed until is finished meanwhile any other processes that come are added to the queue.
- 4Shortest job firstPicks the job that requires the shortest amount of time to do and processes that first.
- 5Shortest Remaining TimeThe scheduler estimates how long each process will take and pick the shortest one and run it.
- 6Multi-level feedback queuesUses numerous queues. Each queue has different priorities. The algorithm can move jobs depending on the jobs behaviour
Información
- Descripción
- AS - Level Computer Science Fichas sobre Scheduling, creado por Nathan King el 31/05/2016.
- Creado por
- Nathan King
- Visitas
- 0
- Etiquetas
- Valoración