The project will consist of creating a simulation of an operating system scheduler handling multiple threads or processes. The student will create a program that launches 6 - 10 worker threads simulating a processor bound, I/O bound and an intermediate of the two types. The program will schedule the tasks using the First-Come, First-Served (FCFS), Shortest Job First, and Round Robin scheduling algorithms. The Program should be written in Java and the Round Robin algorithm should employ the suspend() and resume() thread methods (Please use synchronize to ensure deadlock does not occur).
I have written 1/3 of the code I just need Round Ribin and Shortest Job First. The methods for the IO, CPU and a combination of both are included in my code. If you can improve this please feel free. I just ran out of time due to work to finish this project.
The program should display for each of the three scenarios. CPU intense, IO intense and a combination of both.
ID
Arrival time
Burst Time
Finish Time
Wait Time
Completed Time
Average Wait Time
I need this to be completed in the next 24-48 hours as Wednesday is my deadline. Thank you.