Question: For P1, P2,..,P5 processes, choose random and different millisecond time units between 2-10 and write them next to them (it will be obvious that those who choose the same as their friend are cheating) For example P1:(), P2: (),... P5: () will be filled in ms and will be special for you. A) Calculate the average waiting time according to the following planning algorithms ▸ First-Come, First-Served Scheduling ▶ Shortest-Job-First Scheduling ▸ Priority Scheduling (priority number is same as process number. P1=1,...,P5=5) ▸ Round-Robin Scheduling (let time intervals be 3 ms) B) Which method resulted in less waiting time, please specify in the report.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Question: For P1,P2,..,P5 processes, choose random and different millisecond time units
between 2-10 and write them next to them (it will be obvious that those who choose the
same as their friend are cheating) For example P1:(), P2: (),... P5: () will be filled in ms
and will be special for you.
A) Calculate the average waiting time according to the following planning algorithms
First-Come, First-Served Scheduling
▶ Shortest-Job-First Scheduling
▸ Priority Scheduling (priority number is same as process number. P1=1,...,P5=5)
Round-Robin Scheduling ( let time intervals be 3 ms)
B) Which method resulted in less waiting time, please specify in the report.
Transcribed Image Text:Question: For P1,P2,..,P5 processes, choose random and different millisecond time units between 2-10 and write them next to them (it will be obvious that those who choose the same as their friend are cheating) For example P1:(), P2: (),... P5: () will be filled in ms and will be special for you. A) Calculate the average waiting time according to the following planning algorithms First-Come, First-Served Scheduling ▶ Shortest-Job-First Scheduling ▸ Priority Scheduling (priority number is same as process number. P1=1,...,P5=5) Round-Robin Scheduling ( let time intervals be 3 ms) B) Which method resulted in less waiting time, please specify in the report.
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY