scheduling

Question 1

What is scheduling?

Answer 1

Scheduling is processing multiple threads all executed at once. This will allow things to flow smoothly. For example: updating player hp or moving player object and then finding out what the best way of processing those things concurrently is.

Question 2

What is the FCSC algorithm?

Answer 2

The First come first serve algorithm (FCSC) is processing things in the order they arrive in. If a process takes a long time, others just have to wait until it finishes. This can be a bad algorithm if there is something vital at the back of the queue.

Question 3

What is the SJF algorithm?

Answer 3

The Shortest job first algorithm (SJF) is picking the process that takes the shortest amount of time to process. The scheduler needs to know how long each process will take.

Question 4

What is the RR algorithm?

Answer 4

The Round robin algorithm (RR) is allocating a fixed amount of time to each task known as a time slice or a quantum. If the task hasn’t completed processing in that time frame, it will go to the back of the queue and allow other things to be processed.

Question 5

What is the SRT algorithm?

Answer 5

The Shortest remaining time algorithm (SRT) is a pre-emptive algorithm, meaning that processes can be suspended if a higher-priority process has joined the queue. The process with the least amount of time remaining to process goes to the front of the queue.

Question 6

What is process blocking?

Answer 6

When a process requires data from the hard disk, it is blocked until the input request has been serviced. Other processes will run during this time. For the original process to come back to the queue, it needs to generate an interrupt to let the scheduler know it can re-join the queue.

Question 7

What is the MLFQ algorithm?

Answer 7

The Multi-level feedback queues algorithm (MLFQ) is used when a computer system has more than one processor or processor core. It can handle multiple processes at once and therefore create more queues. Different queues can have different priorities and the scheduler can move jobs between the different queues

Question 8

Which algorithms are pre-emptive? (able to replace the current process with an interrupt)

Answer 8

The round robin (RR), the shortest remaining time (SRT) , and the multi-level feedback queues (MLFQ)

Question 9

Which algorithms are non pre-emptive? (don’t replace the current task with an interrupt)

Answer 9

first come first serve (FCSC) and the shortest job first (SJF)