A display for 3 processes labelled A, B and C. Where
A requires 2 units of time NUT = 2, and arrival time AT = 0.
B requires 3 units of time NUT = 3, and arrival time AT = 0.
C requires 2 units of time NUT = 2, and arrival time AT = 2.
And the unit time allowed for each process UT = 1 with the two incremental factors ready_list = 2; accepted_list = 1
Note when two or more processes have an equivalent arrival times then queue them in the order they arrive i.e. 1st come 1st on the queue.
Assume processes are migrated from the ready_list to the accepted_list at the end of a timecycle
Your program should then display
T A B C
0 R W -
1 W R -
2 R W W
3 F R W
4 F W R
5 F R W
6 F F R
7 F F F
Each run should stop when all processes have F status; where T shows each unit cycle of time.
Finally your program should display the stats associated with each processes throughput, namely arrival time, start time, wait time, completion time, NUT, penalty ratio.