projectcsc227 phase2

Introduction Short term scheduling is an integral part of multiprogramming operating systems. Such operating systems allow more than one process to be loaded into the memory (ready queue) at a time and the loaded process share the CPU using time sharing. The OS CPU scheduler schedules different processes to be assigned to the CPU based on particular scheduling algorithm. There are six popular process scheduling algorithms: 1. First-Come, First-Served (FCFS) Scheduling 2. Shortest-Job-Next (SJN) Scheduling 3. Priority Scheduling 4. Shortest Remaining Time 5. Round Robin(RR) Scheduling 6. Multiple-Level Queues Scheduling Objective In this project, you will simulate CPU scheduling component of operating system. You will gain knowledge of how short term scheduling works. Project Description: In this project you will simulate Round Robin scheduling algorithm. For the sake of simulation, consider a simple system with a single CPU, single I/O device. The CPU has a ready queue and an I/O queue. The system will select a process from the ready queue based on RR algorithm (quantum time will be given to you) and send it to CPU. Information about a process is maintained in process control block (PCB) during the lifetime of the process i.e. from start until termination. Each process PCB contains all required information to identify the process such as its id, its state, and required statistics which include turnaround time for each process, and waiting time for each process. You can add other fields to PCB to help you in programming. Your program should provide average turnaround time, average waiting time, and CPU utilization for a given input file. Specifications 1. CPU burst is between 2ms and 10ms. must be in java language Phase2: PA new data file (of standard format) will be provided to every student i.e. every member of group which he will use to simulate his project and then submit the result. Statistics required in this phase are: • Time the first process arrives. • PID of the second process executed. • Time the last process executed. • PID of the last process executed. • Finish time of every process. • Total time for execution of all processes. • Average turnaround time. • Average waiting time.