the project is to write a java program that simulates the CPU Scheduler
Budget: $10 – $30 USD
The purpose of this project is to write a java program that simulates the CPU Scheduler (also known as Short-Term Scheduler) of an operating system. This is a group project. Each group can have up to 3 students.
The program implements the following CPU scheduling algorithms.
1. First-Come-First-Serve (FCFS)
2. Shortest-Job-First (SJF)
3. Round-Robin with time slice = 3 (RR-3)
4. Round-Robin with time slice = 5 (RR-5)
The program will read process burst times from a file (job.txt) - this file will be provided by the instructor.
A sample input file of four jobs is given as follows (burst time in ms).:
[Begin of job.txt]
Job1
5
Job2
3
Job3
8
Job4
6
[End of job.txt]
Note: You can assume that
(1) there are no more than 30 jobs in the input file (job.txt).
(2) processes arrive in the order they are read from the file for FCFS, RR-2, and RR-5.
(3) all jobs arrive at time 0 for SJF.
The program implements the following CPU scheduling algorithms.
1. First-Come-First-Serve (FCFS)
2. Shortest-Job-First (SJF)
3. Round-Robin with time slice = 3 (RR-3)
4. Round-Robin with time slice = 5 (RR-5)
The program will read process burst times from a file (job.txt) - this file will be provided by the instructor.
A sample input file of four jobs is given as follows (burst time in ms).:
[Begin of job.txt]
Job1
5
Job2
3
Job3
8
Job4
6
[End of job.txt]
Note: You can assume that
(1) there are no more than 30 jobs in the input file (job.txt).
(2) processes arrive in the order they are read from the file for FCFS, RR-2, and RR-5.
(3) all jobs arrive at time 0 for SJF.