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.

Microsoft Visual C#
7th Edition
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Joyce, Farrell.
Chapter8: Advanced Method Concepts
Section: Chapter Questions
Problem 7RQ
icon
Related questions
Question

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 algorithm. Since the project intends to simulate a CPU scheduler, so it does not require any actual process creation or execution. When a task is scheduled, the simulator will simply print out what task is selected to run at a time. It outputs the way similar to Gantt chart style. Project Descriptions and Requirements: The selected scheduling algorithms to implement in this project are 1) First Come First Serve (FCFS), 2) Shortest Job First (SJF) and Shortest Remaining Time First (SRTF) OR , Priority and Preemptive Priority , and 3) Round 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.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 6 steps

Blurred answer
Knowledge Booster
Software Development Approaches
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Microsoft Visual C#
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,