Suppose the OS makes the following scheduling decisions: At time 0, Job 1 arrives and is placed on the CPU for 10 ms. At time 10, Job 1 completes and Job 2 arrives. Job 2 is placed on the CPU for 30 ms. At time 45, Job 3 arrives and is placed on the CPU for 20ms. At time 65, Job 3 completes and Job 2 is returned to the CPU for 15 ms. At time 80, Job 2 completes. a) What is the utilization?
Suppose the OS makes the following scheduling decisions: At time 0, Job 1 arrives and is placed on the CPU for 10 ms. At time 10, Job 1 completes and Job 2 arrives. Job 2 is placed on the CPU for 30 ms. At time 45, Job 3 arrives and is placed on the CPU for 20ms. At time 65, Job 3 completes and Job 2 is returned to the CPU for 15 ms. At time 80, Job 2 completes. a) What is the utilization?
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:### Scheduling Decisions and Performance Metrics
Suppose the OS makes the following scheduling decisions:
- **At time 0:** Job 1 arrives and is placed on the CPU for 10 ms.
- **At time 10:** Job 1 completes and Job 2 arrives. Job 2 is placed on the CPU for 30 ms.
- **At time 45:** Job 3 arrives and is placed on the CPU for 20 ms.
- **At time 65:** Job 3 completes and Job 2 is returned to the CPU for 15 ms.
- **At time 80:** Job 2 completes.
#### Questions:
a) **What is the utilization?**
b) **What is the makespan?**
c) **What is the sum of completion times?**
---
#### Explanation:
For each metric:
- **Utilization:** The percentage of time the CPU is actively processing jobs.
- **Makespan:** The total time from the start of the first job to the completion of the last job.
- **Sum of Completion Times:** The total of each job's completion time measured from when each job started.
Understanding these metrics is crucial for analyzing the performance of scheduling policies.
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 2 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