Question: Implement an FCFS cpu scheduler simulation in Java with the following information: 1. All processes are activated at time 0 2. Assume that no process
Implement an FCFS cpu scheduler simulation in Java with the following information:


1. All processes are activated at time 0 2. Assume that no process waits on I/O devices. 3. After completing an VO event, a process is transferred to the ready queue. 4. Waiting time is accumulated while a process waits in the ready queue. Process Data: process goes CPU burst, /O time, CPU burst, LO time, CPU burst, O time,st CPU burs P1 4, 15, 5, 31, 6, 26, 7, 24, 6, 41, 4, 51, 5, 16, 4) P2 9, 28, 11, 22, 15, 21, 12, 28, 8, 34, 11, 34, 9, 29, 1, 31, 7) P3 24, 28, 12, 21, 6, 27, 17, 21, 11, 54, 22, 31, 18) P4 15, 35, 14, 41, 16, 45, 18, 51, 14, 61, 13, 54, 16, 61, 15) P5 6, 22, 5, 21, 15, 31, 4, 26, 7, 31, 4, 18, 6, 21, 10, 33, 3) P6 22, 38, 27, 41, 25, 29, 11, 26, 19, 32, 18, 22, 6, 26, 6) P7 4, 36, 7, 31, 6, 32, 5, 41, 4, 42, 7, 39, 6, 33, 5, 34, 6, 21, 9) P8 5, 14, 4, 33, 6, 31, 4, 31, 6, 27, 5, 21, 4, 19, 6, 11, 6) 1. All processes are activated at time 0 2. Assume that no process waits on I/O devices. 3. After completing an VO event, a process is transferred to the ready queue. 4. Waiting time is accumulated while a process waits in the ready queue. Process Data: process goes CPU burst, /O time, CPU burst, LO time, CPU burst, O time,st CPU burs P1 4, 15, 5, 31, 6, 26, 7, 24, 6, 41, 4, 51, 5, 16, 4) P2 9, 28, 11, 22, 15, 21, 12, 28, 8, 34, 11, 34, 9, 29, 1, 31, 7) P3 24, 28, 12, 21, 6, 27, 17, 21, 11, 54, 22, 31, 18) P4 15, 35, 14, 41, 16, 45, 18, 51, 14, 61, 13, 54, 16, 61, 15) P5 6, 22, 5, 21, 15, 31, 4, 26, 7, 31, 4, 18, 6, 21, 10, 33, 3) P6 22, 38, 27, 41, 25, 29, 11, 26, 19, 32, 18, 22, 6, 26, 6) P7 4, 36, 7, 31, 6, 32, 5, 41, 4, 42, 7, 39, 6, 33, 5, 34, 6, 21, 9) P8 5, 14, 4, 33, 6, 31, 4, 31, 6, 27, 5, 21, 4, 19, 6, 11, 6)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
