Assume that your computing infrastructure has 6 processors available. Processors are identified as PA, PB, .., PF. Now consider the system contains n = 250 processes with different runtime requirements. Specifically, each process has associated with it a burst time (processing time) and a memory requirement. Burst-times are assigned at random (10 * 106 – 10 *1012 cycles). Memory requirements are assigned at random (1 MB – 16GB). For questions 1- 3, you may assume that the set of 250 processes is known a-priori; Hence, your algorithms will have full knowledge of all the processes in the system at the start of the simulation. 1. Suppose that all 6 processors are identical (i.e., same speed and memory), benchmark each of the following scheduling algorithms that we talked about in class. Compute the average wait time and average turnaround time for each scheduling algorithm. а. FIFO b. SJF С. RR

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

PLEASE PLEASE DO THE CODING IN PYTHONS PLEASE PLEASE

Assume that your computing infrastructure has 6 processors available. Processors are identified as PA,
PF. Now consider the system contains n = 250 processes with different runtime requirements.
Рв,
Specifically, each process has associated with it a burst time (processing time) and a memory
requirement. Burst-times are assigned at random (10 * 106 – 10 *1012 cycles). Memory requirements are
assigned at random (1 MB – 16GB).
For questions 1-3, you may assume that the set of 250 processes is known a-priori; Hence, your
algorithms will have full knowledge of all the processes in the system at the start of the simulation.
1. Suppose that all 6 processors are identical (i.e., same speed and memory), benchmark each of
the following scheduling algorithms that we talked about in class. Compute the average wait
time and average turnaround time for each scheduling algorithm.
а.
FIFO
b. SJF
С.
RR
Transcribed Image Text:Assume that your computing infrastructure has 6 processors available. Processors are identified as PA, PF. Now consider the system contains n = 250 processes with different runtime requirements. Рв, Specifically, each process has associated with it a burst time (processing time) and a memory requirement. Burst-times are assigned at random (10 * 106 – 10 *1012 cycles). Memory requirements are assigned at random (1 MB – 16GB). For questions 1-3, you may assume that the set of 250 processes is known a-priori; Hence, your algorithms will have full knowledge of all the processes in the system at the start of the simulation. 1. Suppose that all 6 processors are identical (i.e., same speed and memory), benchmark each of the following scheduling algorithms that we talked about in class. Compute the average wait time and average turnaround time for each scheduling algorithm. а. FIFO b. SJF С. RR
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
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