Process states and state transition


Perform problem 3.2, at the end of Chapter 3 of the Stallings textbook. Utilize this spreadsheet to help you. Refer to the set of available states in Chapter 3's Figure 3.9b.

The problem involves 5 processes, and their evolution from their initial state over a series of events that occur. Assume the initial state shown in the top row of the spreadsheet. That is, process 1 is running and the other 4 are in a ready queue in the order shown. Treat the ready queue as simple first-come-first-served, so that when a process enters the queue it's placed at the right, and when a fresh process is to be moved into the running state it will be the left-most in the queue. To decide at each event which process to run next when several are waiting in the ready queue, be guided by what the problem says happens in the next event following. For example if processes 1, 2, and 3 are in the ready queue, and when you look below you see that the next event involves process 2 doing something, that implies process 2 needs to be chosen to run now (so that it will be able to "do something" at the next juncture).

The processes will move in the spreadsheet (horizontally) from one state to another, as one event follows another. At all times all 5 processes must be somewhere, in one state (column) or another.

After you have evolved the processes through the events over time, fill in the "what is the state of affairs at this point?" rows. (Those will be the same as the rows above them.) Upload a screenshot showing your filled-in spreadsheet file. Name the screenshot file "process-states.jpg" or "process-states.png".