Task 1 Eight batch jobs arrive almost at the same time in the following order: II₁, II2, ..., II8. The table below contains their running times and priorities: Job П1 П2 П3 П П П П П 4 6 7 Running time (in min) 11 20 10 8 18 7 9 Priority 4 3 2 7 5 8 1 6 The highest priority is 1. (a) Assume that the system has only one CPU core. Determine the order of execution of processes and the average turnaround time for the priority scheduling and the first-come, first-served algorithm. (b) Now assume that the system has 3 CPU cores. The following algorithm is used: whenever a CPU core is available (e.g., after a process terminates), the scheduler picks a process with the highest priority from the queue. Determine the order of execution of processes and the average turnaround time. (For each process, you also need to clearly indicate on which core it is executed.) (c) Now assume that the system has 2 CPU cores. The system may execute the processes in any order and arbitrarily distribute processes among cores. Find a schedule that minimises the largest turnaround time (i.e. the last process terminates as soon as possible). Are there several such solutions? If yes, find the one that also minimises the average turnaround time.
Task 1 Eight batch jobs arrive almost at the same time in the following order: II₁, II2, ..., II8. The table below contains their running times and priorities: Job П1 П2 П3 П П П П П 4 6 7 Running time (in min) 11 20 10 8 18 7 9 Priority 4 3 2 7 5 8 1 6 The highest priority is 1. (a) Assume that the system has only one CPU core. Determine the order of execution of processes and the average turnaround time for the priority scheduling and the first-come, first-served algorithm. (b) Now assume that the system has 3 CPU cores. The following algorithm is used: whenever a CPU core is available (e.g., after a process terminates), the scheduler picks a process with the highest priority from the queue. Determine the order of execution of processes and the average turnaround time. (For each process, you also need to clearly indicate on which core it is executed.) (c) Now assume that the system has 2 CPU cores. The system may execute the processes in any order and arbitrarily distribute processes among cores. Find a schedule that minimises the largest turnaround time (i.e. the last process terminates as soon as possible). Are there several such solutions? If yes, find the one that also minimises the average turnaround time.
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
Question
Transcribed Image Text:Task 1
Eight batch jobs arrive almost at the same time in the following order: II₁, II2, ..., II8.
The table below contains their running times and priorities:
Job П1 П2 П3 П П П П П
4
6
7
Running time (in min)
11 20
10 8
18 7
9
Priority
4
3
2
7
5
8
1 6
The highest priority is 1.
(a) Assume that the system has only one CPU core. Determine the order of execution
of processes and the average turnaround time for the priority scheduling and the
first-come, first-served algorithm.
(b) Now assume that the system has 3 CPU cores. The following algorithm is used:
whenever a CPU core is available (e.g., after a process terminates), the scheduler
picks a process with the highest priority from the queue. Determine the order of
execution of processes and the average turnaround time. (For each process, you also
need to clearly indicate on which core it is executed.)
(c) Now assume that the system has 2 CPU cores. The system may execute the
processes in any order and arbitrarily distribute processes among cores. Find a
schedule that minimises the largest turnaround time (i.e. the last process terminates
as soon as possible). Are there several such solutions? If yes, find the one that also
minimises the average turnaround time.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
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