Comparative CPU Scheduling Algorithms

The assignment is to write a Java program for implementing First-Come-First-Served(FCFS) , Shortest-Job-First(SJF), and Round-Robin(RR) algorithms and using simulation program to comparing the performance of these scheduling. The performance is based on the application of incoming processes(jobs). These processes under different simulated inputs will show different results for studying performance. The simulation program limits to be a single-CPU system. Create a random generator for creating process ID, arrival time, and burst time. These process are executed by FCFS, SJF, and RR algorithms. The outputs are the measures of the waiting time of these three scheduling. ## Deliverables This is for a class called Operating Systems. Due date is March 29th. The goals are : To study and understand a variety of CPU scheduling algorithms; to profile and analyze various measures of scheduling criteria.