Robin (RR). The detailed algorithms will be discussed in class. The task information will be entered from the keyboard. The format is process_id arrival_time, and burst_time. All of data are integer type where process_id is a unique numeric process ID, arrival_time is the time when the task arrives in the unit of milliseconds, burst_time the is the CPU time requested by a task, in the unit of milliseconds The time unit for arrival_time, burst_time and interval is millisecond. After entering the information mentioned earlier, ask user to input what scheduling algorithm to use. As soon as the task is completed, the program should compute and print 1) average waiting time, 2) average response time, 3) average turnaround time and 4) overall CPU usage 5) Gantt Chart. Note: if you use static array to implement ready queue structure, you can assume the maximum queue length of 5.
Project Objectives: This programming project is to simulate a few CPU scheduling policies discussed in the class. You will writeC++ program to implement a simulator with different scheduling algorithms. The simulator selects a task to run from ready queue based on the scheduling
Trending now
This is a popular solution!
Step by step
Solved in 6 steps
