Consider the following task set. Task Name T1 T2 T3 T4 T5 Priority (when applicable) 2 4 3 3 1 CPU burst (ms) 20 25 25 15 10 Task Set. Priorities range from 1 to 4, where a lower numeric value indicates a higher relative priority. For round-robin scheduling, the length of a time quantum is 10 milliseconds. The following four scheduling algorithms should be implemented in four different threads using Java programming language. The main thread in your program will finally print on console the generated schedule using a modified Gantt chart, average waiting time, and average turnaround time for each algorithm. 1. First-come, first-served (FCFS) assuming all the tasks arrive at the same time. 2. Shortest-job-first (SJF) assuming all the tasks arrive at the same time and also breaking ties randomly. 3. Preemptive priority scheduling (PS) using the priorities given in the task set and using a random arrival time (in ms) in the interval [0, 100] for each task. You must generate random arrival times using a java random number generator function. You must also print the arrival times generated by your program before you print this schedule. 4. Round-robin (RR) scheduling, where each task is run for a time quantum (or for the remainder of its CPU burst).
Consider the following task set. Task Name T1 T2 T3 T4 T5 Priority (when applicable) 2 4 3 3 1 CPU burst (ms) 20 25 25 15 10 Task Set. Priorities range from 1 to 4, where a lower numeric value indicates a higher relative priority. For round-robin scheduling, the length of a time quantum is 10 milliseconds. The following four scheduling algorithms should be implemented in four different threads using Java programming language. The main thread in your program will finally print on console the generated schedule using a modified Gantt chart, average waiting time, and average turnaround time for each algorithm. 1. First-come, first-served (FCFS) assuming all the tasks arrive at the same time. 2. Shortest-job-first (SJF) assuming all the tasks arrive at the same time and also breaking ties randomly. 3. Preemptive priority scheduling (PS) using the priorities given in the task set and using a random arrival time (in ms) in the interval [0, 100] for each task. You must generate random arrival times using a java random number generator function. You must also print the arrival times generated by your program before you print this schedule. 4. Round-robin (RR) scheduling, where each task is run for a time quantum (or for the remainder of its CPU burst).
Chapter11: Operating Systems
Section: Chapter Questions
Problem 8RQ
Related questions
Question
Java
Please help me with this Java Progamming project
NOT GRADED. Practice homework
Please comment the code well and organize the classes so I can understand. Thank you!
You sent back a solution but the waiting time was negative and that was incorrect. Please take your time and help me with this. The code that was sent to me before did not work.
I pay for this subscription and I keep getting wrong answers...Please...
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps
Knowledge Booster
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.Recommended textbooks for you
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning