Created by Lewis Hunt
over 8 years ago
|
||
Question | Answer |
What is a scheduler? | A program that manages the amount of time different processes have in the CPU |
How does a scheduler work? | It uses a scheduling algorithm to determine how to share processor time |
What 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 |
What 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. |
What is shortest job first scheduling? | It picks the job that will take the shortest time and runs it until it finishes. |
What 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. |
What 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. |
Want to create your own Flashcards for free with GoConqr? Learn more.