Project: CPU Scheduling Simulator in Java Project Overview This project aims to create a Java-based simulator that visually demonstrates various CPU scheduling algorithms. The simulator will allow users to input parameters such as the number of processes, their arrival times, burst times, and the scheduling algorithm to be used. It will then visually simulate the execution of these processes and provide performance metrics. Required Features: 1. Process Creation: • Allow users to input the number of processes. o Generate random or user-defined arrival times and burst times for each process. o Create process objects with their respective attributes. 2. Scheduling Algorithm Selection: Implement at least three common CPU scheduling algorithms: First-Come-First-Served (FCFS) Shortest Job First (SJF) Round Robin Multilevel scheduling (with 3 different priorities; 1, 2 and 3), using the following algorithms: Q1 (priority=1) Priority scheduling Q2 (priority=2) - Priority scheduling Q3 (priority-3) Shortest Job First Description and Instructions Processes enter the queue according to its priority. To avoid starvation, the process from the lower queue will be upgraded to higher queue after a certain time threshold to avoid starvation. The threshold is to be set by the user. 3. Simulation: 。 Simulate the execution of processes based on the selected algorithm. 4. Performance Metrics: o Calculate and display performance metrics such as: Average waiting time ■ Average turnaround time 5. Deliverables: o Project report You must include a screen capture images of the output along with description. You should also include the important part of your code with description. Please include a table of group members and the tasks carried out by each. o Source code Should be commented and indent.

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
Please don't use AI
Project: CPU Scheduling Simulator in Java
Project Overview
This project aims to create a Java-based simulator that visually demonstrates
various CPU scheduling algorithms. The simulator will allow users to input
parameters such as the number of processes, their arrival times, burst times,
and the scheduling algorithm to be used. It will then visually simulate the
execution of these processes and provide performance metrics.
Required Features:
1. Process Creation:
• Allow users to input the number of processes.
o Generate random or user-defined arrival times and burst times for
each process.
o Create process objects with their respective attributes.
2. Scheduling Algorithm Selection: Implement at least three common CPU
scheduling algorithms:
First-Come-First-Served (FCFS)
Shortest Job First (SJF)
Round Robin
Multilevel scheduling (with 3 different priorities; 1, 2 and 3), using
the following algorithms:
Q1 (priority=1) Priority scheduling
Q2 (priority=2) - Priority scheduling
Q3 (priority-3) Shortest Job First
Description and Instructions
Processes enter the queue according to its priority. To avoid
starvation, the process from the lower queue will be upgraded to
higher queue after a certain time threshold to avoid starvation.
The threshold is to be set by the user.
3. Simulation:
。 Simulate the execution of processes based on the selected
algorithm.
4. Performance Metrics:
o Calculate and display performance metrics such as:
Average waiting time
■ Average turnaround time
5. Deliverables:
o Project report
You must include a screen capture images of the output along with
description. You should also include the important part of your code
with description. Please include a table of group members and the tasks
carried out by each.
o Source code
Should be commented and indent.
Transcribed Image Text:Project: CPU Scheduling Simulator in Java Project Overview This project aims to create a Java-based simulator that visually demonstrates various CPU scheduling algorithms. The simulator will allow users to input parameters such as the number of processes, their arrival times, burst times, and the scheduling algorithm to be used. It will then visually simulate the execution of these processes and provide performance metrics. Required Features: 1. Process Creation: • Allow users to input the number of processes. o Generate random or user-defined arrival times and burst times for each process. o Create process objects with their respective attributes. 2. Scheduling Algorithm Selection: Implement at least three common CPU scheduling algorithms: First-Come-First-Served (FCFS) Shortest Job First (SJF) Round Robin Multilevel scheduling (with 3 different priorities; 1, 2 and 3), using the following algorithms: Q1 (priority=1) Priority scheduling Q2 (priority=2) - Priority scheduling Q3 (priority-3) Shortest Job First Description and Instructions Processes enter the queue according to its priority. To avoid starvation, the process from the lower queue will be upgraded to higher queue after a certain time threshold to avoid starvation. The threshold is to be set by the user. 3. Simulation: 。 Simulate the execution of processes based on the selected algorithm. 4. Performance Metrics: o Calculate and display performance metrics such as: Average waiting time ■ Average turnaround time 5. Deliverables: o Project report You must include a screen capture images of the output along with description. You should also include the important part of your code with description. Please include a table of group members and the tasks carried out by each. o Source code Should be commented and indent.
Expert Solution
steps

Step by step

Solved in 2 steps with 4 images

Blurred answer
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,
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning