Create a program in C that will run two different scheduling algorithms and compare the waiting time of each process and the average waiting time of the complete set of processes. The program will begin by getting the processes file as an inline parameter and will read the contents in an array. The program will then create a child process to run the FCFS scheduling algorithm and then another child to run the SJF algorithm. Each child will print the waiting time of each process when it finishes and the average waiting time when all processes are complete. Example: FCFS: P1 Waiting time: 0 FCFS: P2 Waiting time: 10 FCFS: P3 Waiting time: 25 SJF: P1 Waiting time: 10 SJF: P2 Waiting time: 0 SJF: P3 Waiting time: 25 FCFS: Average Waiting Time: 35/3 SJF: Average Waiting Time: 35/3

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
Create a program in C that will run two different scheduling algorithms and compare the waiting time of each process and the
average waiting time of the complete set of processes. The program will begin by getting the processes file as an inline parameter
and will read the contents in an array. The program will then create a child process to run the FCFS scheduling algorithm and then
another child to run the SJF algorithm. Each child will print the waiting time of each process when it finishes and the average waiting
time when all processes are complete.
Example:
FCFS: P1 Waiting time: 0
FCFS: P2 Waiting time: 10
FCFS: P3 Waiting time: 25
SJF: P1 Waiting time: 10
SJF: P2 Waiting time: 0
SJF: P3 Waiting time: 25
FCFS: Average Waiting Time: 35/3
SJF: Average Waiting Time: 35/3
Transcribed Image Text:Create a program in C that will run two different scheduling algorithms and compare the waiting time of each process and the average waiting time of the complete set of processes. The program will begin by getting the processes file as an inline parameter and will read the contents in an array. The program will then create a child process to run the FCFS scheduling algorithm and then another child to run the SJF algorithm. Each child will print the waiting time of each process when it finishes and the average waiting time when all processes are complete. Example: FCFS: P1 Waiting time: 0 FCFS: P2 Waiting time: 10 FCFS: P3 Waiting time: 25 SJF: P1 Waiting time: 10 SJF: P2 Waiting time: 0 SJF: P3 Waiting time: 25 FCFS: Average Waiting Time: 35/3 SJF: Average Waiting Time: 35/3
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Similar 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