Question
Consider the following set of processes (tuples look like process, burst size): (P0, 10), (P1, 30), (P2, 15), (P3, 5). Assume the processes arrive in
Consider the following set of processes (tuples look like process, burst size): (P0, 10), (P1, 30), (P2, 15), (P3, 5). Assume the processes arrive in this order as well. Compute the average waiting time and average turnaround time for the following algorithms, and answer the final question:
-First-Come First-Served
-Shortest-Job-First
-Priority Scheduling (Assume priority is calculated as 5*processnumber+bursttime)
-Round Robin Scheduling (use time quantum 10)
Which of these algorithms gives the best turnaround time for this list of processes?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Advances In Databases And Information Systems 14th East European Conference Adbis 2010 Novi Sad Serbia September 2010 Proceedings Lncs 6295
Authors: Barbara Catania ,Mirjana Ivanovic ,Bernhard Thalheim
2010th Edition
3642155758, 978-3642155758
