1) There are many different scheduling policies, but this assignment will simply run the processes in the order in which they appear — which is very easy to do with a linked list. 2) No Operating System can accurately predict just how much time any process will need to use the CPU. It might have very little work to do, and finishes quickly. Or it may get stuck in an infinite loop and try to run indefinitely. To guard against the latter, one can just put a limit on one process, after which the CPU is taken away and passed to another. 3) If a process is done, it is removed from the system (and we will put a 'Q' at the end of its history). If it still wants to run some more, we will just put it back into the set of processes that wish to use the CPU.
https://cheapcustompapers.org/wp-content/uploads/2021/05/cheap-custom-papers.png 0 0 https://cheapcustompapers.org/wp-content/uploads/2021/05/cheap-custom-papers.png 2020-06-20 07:35:032021-01-17 08:27:33There are many different scheduling policies, but this assignment will simply run the processes