26 )The following processes are submitted to an operating system. which require no input/output (i.e. they are always ready to utilize the CPU) 1. Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, Preemptive and non preemptive SJF, preemptive and nonpreemptive priority, Highest response ratio next (HRRN), and RR (quantum-2). 2. What is the average turnaround time average waiting time, schedule length, and throughput of each process for each of the scheduling algorithms in part 1? 3. Which of the algorithms results in the minimum average waiting time (over all processes)? ( 1. FCFS PID AT BT CT TAT WT P1 0 S P2 2 6 P3 2 1 P4 1 9 P5 3 3 Gantt Chart: . 2. Non-Preemptive SJF PID PI P2 P3 P4 P5 . AT BT CT TAT 0 8 6 1 9 3 Gantt Chart: Pl P2 P3 2 2 3. Preemptive SJF PID AT . 1 3 BT CT TAT 0 S 2 6 1 2 P4 1 9 P5 3 3 Gantt Chart: WT WT . . . . . . Average Turnaround Time- Average Waiting time = ScheduleLength Throughtput- Average Turnaround Time= Average Waiting time- Schedule Length= Throughput Average Turnaround Time Average Waiting time- Schedule Length= Throughtpat-

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Topic Video
Question

Send original answer, do not copy anything, otherwize will give multiple dislikes. 

Q6 )The following processes are submitted to an operating system. They are calculation processes
which require no input/output (i.e. they are always ready to utilize the CPU)
1. Draw Gantt charts that illustrate the execution of these processes using the following scheduling
algorithms: FCFS, Preemptive and non preemptive SJF, preemptive and nonpreemptive
priority, Highest response ratio next (HRRN), and RR (quantum = 2).
2. What is the average turnaround time average waiting time, schedule length, and throughput
of each process for each of the scheduling algorithms in part 1?
3. Which of the algorithms results in the minimum average waiting time (over all processes)? (
1. FCFS
PID AT BT
P1 0 8
P2
6
2
1
1
9
3
3
Gantt Chart:
P3
P4
P5
.
2. Non-Preemptive SJF
PID AT BT CT TAT
Pl
0
8
P2
P3
6
1
P4
1
9
P5 3 3
Gantt Chart:
2
2
.
2
3. Preemptive SJF
CT TAT WT
PID
Pl 0 8
P2
2
6
P3
2
1
P4
1 9
PS
3 3
Gantt Chart:
AT BT CT ΤΑΊ
WT
WT
.
.
Average Turnaround Time-
Average Waiting time =
Schedule Length=
Throughtput-
Average Turnaround Time=
Average Waiting time -
Schedule Length=
Throughput
Average Turnaround Time
Average Waiting time-
Schedule Length=
Throughtpat
Transcribed Image Text:Q6 )The following processes are submitted to an operating system. They are calculation processes which require no input/output (i.e. they are always ready to utilize the CPU) 1. Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, Preemptive and non preemptive SJF, preemptive and nonpreemptive priority, Highest response ratio next (HRRN), and RR (quantum = 2). 2. What is the average turnaround time average waiting time, schedule length, and throughput of each process for each of the scheduling algorithms in part 1? 3. Which of the algorithms results in the minimum average waiting time (over all processes)? ( 1. FCFS PID AT BT P1 0 8 P2 6 2 1 1 9 3 3 Gantt Chart: P3 P4 P5 . 2. Non-Preemptive SJF PID AT BT CT TAT Pl 0 8 P2 P3 6 1 P4 1 9 P5 3 3 Gantt Chart: 2 2 . 2 3. Preemptive SJF CT TAT WT PID Pl 0 8 P2 2 6 P3 2 1 P4 1 9 PS 3 3 Gantt Chart: AT BT CT ΤΑΊ WT WT . . Average Turnaround Time- Average Waiting time = Schedule Length= Throughtput- Average Turnaround Time= Average Waiting time - Schedule Length= Throughput Average Turnaround Time Average Waiting time- Schedule Length= Throughtpat
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Instruction Format
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education