Five batch jobs, A, B, C, D, and E, arrive at a computer system at time 0, 1, 2, 3, 4, respectively. And they have service time of 7. 1, 3, 5, and 4, respectively. The new jobs arrive a little ahead of the expiration of time slices. For each of the following scheduling algorithms, determine the turnaround time for each process for all jobs. Ignore process switching overhead. . SRT: Shortest remaining time, a preemptive algorithm (preemption points are whenever a new process arrives) HRRN: Highest response ratio next: non-preemptive FCFS: first come first serve. non-non-preemptive SPN: Shortest process next, non-non-preemptive Secondary Scheduling Policy: FCFS, if the first policy cannot identify the next process, FCFS will be used. . . . RR: Round robin with a time quantum of 2 units. The new processes arrive before the time quantum expires. • Feedback: preemptive, multilevel feedback, when a process has time quantum expires, OS will feed it back into a lower- priority queue, with time quantum extended to 2¹. . Determine the turnaround time Tr RR, q=1 Tr SPN T A B C D E
Five batch jobs, A, B, C, D, and E, arrive at a computer system at time 0, 1, 2, 3, 4, respectively. And they have service time of 7. 1, 3, 5, and 4, respectively. The new jobs arrive a little ahead of the expiration of time slices. For each of the following scheduling algorithms, determine the turnaround time for each process for all jobs. Ignore process switching overhead. . SRT: Shortest remaining time, a preemptive algorithm (preemption points are whenever a new process arrives) HRRN: Highest response ratio next: non-preemptive FCFS: first come first serve. non-non-preemptive SPN: Shortest process next, non-non-preemptive Secondary Scheduling Policy: FCFS, if the first policy cannot identify the next process, FCFS will be used. . . . RR: Round robin with a time quantum of 2 units. The new processes arrive before the time quantum expires. • Feedback: preemptive, multilevel feedback, when a process has time quantum expires, OS will feed it back into a lower- priority queue, with time quantum extended to 2¹. . Determine the turnaround time Tr RR, q=1 Tr SPN T A B C D E
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
Related questions
Topic Video
Question
Transcribed Image Text:Five batch jobs, A, B, C, D, and E, arrive at a computer system at time 0, 1, 2, 3, 4, respectively. And they have service time of 7,
1, 3, 5, and 4, respectively. The new jobs arrive a little ahead of the expiration of time slices. For each of the following scheduling
algorithms, determine the turnaround time for each process for all jobs. Ignore process switching overhead.
RR: Round robin with a time quantum of 2 units. The new processes arrive before the time quantum expires.
Feedback: preemptive, multilevel feedback, when a process has time quantum expires, OS will feed it back into a lower-
priority queue, with time quantum extended to 2⁰.
SRT: Shortest remaining time, a preemptive algorithm (preemption points are whenever a new process arrives)
HRRN: Highest response ratio next: non-preemptive
FCFS: first come first serve. non-non-preemptive
SPN: Shortest process next, non-non-preemptive
Secondary Scheduling Policy: FCFS, if the first policy cannot identify the next process, FCFS will be used.
*
B
0
•
B
RR₁
q=1
Determine the turnaround time Tr
T₁
SPN T
A
B
C
D
E
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education