### 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

The Little Man Computer Calculator Mailboxes 00 500 01 199 02 500 03 399 In Basket 95 96 97 98 99 123 Out Basket 05 Little man Instruction location counter Reset button 1. The Out instruction copies data from the a. In basket to a mailbox alculator to a mailbox c. In basket to the calculator d. mailbox to the calculator e. calculator to the In basket f. none of the above
1.There is always speedup when you have multiple processors 2.Speedup is dependent on f which is the portion of the code run on multiple processors 3.Speedup increases as the f increases 4.None of these
Case Study Assume a computer system has a main memory of 256 Bytes. The following is a memory byte-access trace history of a program run on this system. For example, as it is shown, the program first accesses memory address 0000 0000, and then it accesses memory address 0000 0001 and so on. Note the memory addresses are represented in binary: 00000000, 00000001, 00000010, 00000011, 00001000, 00010000, 00010001, 00000100, 00000101, 00000110, 00000111, 00001001, 00001010, 00001011, 00001100, 00001000, 00001001, 00001010, 00011100, 00011101. Q3. Assume the system has a 16-Byte direct mapped unified L1 cache with a block size of 2 Bytes. The following table shows how the cache looks like after the first access to the memory is finished. Please show; in the provided table, how it looks like after the 20th access is finished. You could ignore the "Data" Column. (Add or remove Rows/Columns in the provided table for your answer, as you see fit). Cache contents after the 1st access: Cache Index…
Q3. CPU works by "Fetch Decode Execute "Cycle. Describe this process technically with example or diagrams wherever it is appropriate
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.
What happens to the CPU when a software requests 1/0? What method is used to notify the CPU that the 10 operation is complete?
Question 1 Derive the minimized Boolean equation for the function F shown in the K-map below. Draw the logic diagram using NAND gates only. 00 01 11 10 АВ 1 00 1 01 X X 1 1 11 X 10 Question 2 Prove that A (B+C) = (A B) + (A C) Monday, December 28, 2020 10:20:38 PM AST
In a 32-bit microprocessor, if any instantaneous PC (program counter), register value of the program is 0xFABB102D (this address is the command that is executed at that time), the PC shows what address value after 7 commands have been executed (run) on the processor.(translate sorry) a. 0xFABB234D b. 0xFABB123D c. 0xFABB124D d. 0xFABB203D e. 0xFABB104D
Assume that a personal computer must get two pieces of data from its memory for every operation (one piece of data indicates which instruction to perform; the other is the information which is operated on). If the computer is the size of a typical PC, how long does it take to get these pieces of data? From this, what is the maximum rate at which the PC can execute instructions? Assume half the speed of light as travel rate.
Suppose that a FSQRT function is responsible for 40% of the execution time of some application and all floating-point FP instructions (ALLFP) are responsible for 55%. To improve the performance of this application, the developers asked you to help them select the best of the following two choices: (Show all your calculations). • First choice: to speed up the function FSQRT by a factor of 10 • Second choice: execute ALLFP instructions 2x faster.
Assume a computer system has a main memory of 256 Bytes. The following is a memory byte-access trace history of a program run on this system. For example, as it is shown, the program first accesses memory address 0000 0000, and then it accesses memory address 0000 0001 and so on. Note the memory addresses are represented in binary: 00000000, 00000001, 00000010, 00000011, 00001000, 00010000, 00010001, 00000100, 00000101, 00000110, 00000111, 00001001, 00001010, 00001011, 00001100, 00001000, 00001001, 00001010, 00011100, 00011101.
Given three CPU s, A,B, and C, where a given program takes 5 ms on A 250 us on B 50 ns on C Find the speed up ratios between A:B. B:C. and A:C