### Scheduling Decisions and Performance MetricsSuppose 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.

Dear Student, The answer to your question is given below -

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

See similar textbooks

Similar questions

Assume that a memory module contains three holes of 10MB each. A sequence of 14 requests for 1MB each will be processed (See the diagram below). For each of the memory allocation methods listed below, draw a diagram representing how memory is allocated and determine the sizes of the remaining holes after all 14 requests have been satisfied. First fit Next fit C. Best fit d. a. b. Worst fit Hint - For the Next fit, the following allocation starts with the hole following the previous allocation 10 Mb 10 Mb 10 Mb
The total number of processes that gets completed in a unit time is called a. Turnaround time O b. Throughput c. Response time d. Waiting Time
How to measure a computer performance ? 2. Suppose we have a program runs in 100 seconds on a computer, and the multiplication subroutine takes 40 seconds. If we want the program to run 30% faster, how many seconds do we have to improve the multiplication subroutine ? 3. There are 2 computers. Computer A clock cycle time is 350ps, CPI is 3. Computer B clock cycle time is 400ps, CPI is 2.5. Which computer runs faster on same program ?
What are the two types of approaches to multiple processors scheduling?
When a CPU sends an interrupt, it is obliged to halt whatever it is doing in order to respond to the signal. I'm interested about the reasoning of halting the procedure in order to finish the assignment. Let's start with the process of interrupting, and then we'll go on to the process of executing. explain?
Q3/ if the Cpu Scheduling Policy is Round Robin with time quantum =2, Calculate the averege iting time Process amual time burst time Po -10 P, Pe P3 - Py - -- 4 --7 -6 --4 2.
The class I'm taking is assembly programming. ***My compiler is visual studio. x86 on windows. must use masm.*** I am completely stuck. I have wrote the instructions for the program below. ****i have attached my work please look it over and tell me how to fix errors. Instructions: Implement the following pseudocode in x86 assembly language. Use short-circuit evaluation and assume that num1 and RESULT are 32-bit variables. if ( num1 > ecx ) AND ( ecx > edx ) RESULT = 1 else RESULT = 2; ***Title your branch label using the 1st letter of your first name and last name. For example, Ann Napa's conditional branch label would be AN: Step through your program with a debugger to see exactly what is going on as you test your program branching execution.
Consider a computer with N processors in a multiprocessor configuration. a. How many processes can be in each of the Ready, Running, and Blocked states at one time? b. What is the minimum number of processes that can be in each of the Ready, Running, and Blocked states at one time?
Imagine that you have implemented an algorithm in a program which has 40% parallelizable code. Now consider the following two cases assuming that scheduling overhead is ignored: -The program is executed on a single processor. -The program is executed on a parallel system with 4 processors. Compute the speed-up gained in the case where multiple processors are used.