Usiing round robin scheduler show which processes run and when. In a priority scheduler, for each unit of time that a process runs its priority decreases by one. A running process is replaced when there is another process on the runnable list with a higher priority. Show which processes run and when. In a two-level scheduler with swapping, the states that a process can be in are runnable, but swapped out runnable, in main memory blocked, and swapped out blocked, in main memory running, in main memory Draw the state transition graph for this.
Starvation occurs when a process never gets a chance to run.
Create a child that keeps looping forever printing a message. Semaphore waiting lists are often implemented as queues served in FIFO order. Then it locks both accounts and transfers the money, releasing the locks when done. If so, devise a scheme to avoid deadlock. Suppose a shared queue is implemented using a wrap-around array.