Fichas
Scheduling
Fichas del conjunto (7)
- 1What is a scheduler?A program that manages the amount of time different processes have in the CPU
- 2How does a scheduler work?It uses a scheduling algorithm to determine how to share processor time
- 3What is Round robin scheduling?Each process is given a fixed amount of time. If it hasn't finished by the end of that time period, it goes to the back of the queue so the next process in the line
- 4What is first come first served scheduling?It's just like queuing in a shop. The first process that arrives is dealt with by the CPU and then the next process and so on.
- 5What is shortest job first scheduling?It picks the job that will take the shortest time and runs it until it finishes.
- 6What is shortest remaining time scheduling?The scheduler estimates how long each process will take. It then picks the one that will take the least amount of time, however, if a new job is added with a shorter remaining time the scheduler will switch to that one.
- 7What are multi-level feedback queues?It uses multiple queues and each queue has a different priority. The algorithm can move jobs between these queues depending on the jobs' behaviour.
Información
- Descripción
- AS - Level (Component 1) Computing Fichas sobre Scheduling, creado por Lewis Hunt el 13/05/2016.
- Creado por
- Lewis Hunt
- Visitas
- 22
- Valoración