e) Consider a multi-level queue in a single-CPU system. The first level is given a quantum of 6 ms, the second one, a quantum of 12 ms, the third is scheduled FCFS. Assume processes arrive all at time zero with the following burst times (in ms): 4, 7, 12, 20, 25 and 30. 1. Draw the Gantt chart for each queue level 2. Compute the average waiting time 3. Compute the average turnaround time

e) Consider a multi-level queue in a single-CPU system. The first level is given a quantum of 6 ms, the second one, a quantum of 12 ms, the third is scheduled FCFS. Assume processes arrive all at time zero with the following burst times (in ms): 4, 7, 12, 20, 25 and 30. 1. Draw the Gantt chart for each queue level 2. Compute the average waiting time 3. Compute 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

See similar textbooks

Similar questions

Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is
A program is profiled on a CPU: 20% of all instructions are arithmetic, 40% are load, 20% are store, 20% are conditional branches. On this CPU, loads take 4 cycles, stores 1 cycle, ALU instructions 2 cycle, and branches 3 cycles. Compute the CPI for each instruction and the average CPI for that program on that CPU: Compute the CPI for each instruction (GIVE ANSWERS WITH 2 DECIMAL DIGITS: CPI for loads is CPI for stores is CPI for ALU is CPI for branches is Average CPI is
Consider two different implementations of the same instruction set architecture (ISA). The instructions can be divided into three classes according to their CPI (classes A, B, and C). P1 with a clock rate of 2,5 GHz and CPIS of 1, 2, and 3, and P2 with a clock rate of 3 GHz and CPIs of 2, 2, and 4. Given a program with a dyñamic instruction count of 5 x 10 instructions divided into classes as follows: 30% class A, 30% class B, and 40% class C. A. What is the global CPI for cach implementation? B. which is faster: P1 or P27 By how much? C. Find the clock cycles required in both cases. eet
In a printing queue, there are a few documents that are still waiting to be printed. To get the documents running, the person in charge of printing executes a series of random activities. Which type of scheduling is best for the aforementioned circumstance, and why?
An example of a MISD machine might be something like a systolic array, which is a kind of array. A pipeline network or "wavefront" of data processing units that is organised as a network might be referred to as a systolic array. Since the receipt of new data is what initiates execution, none of these components need the employment of a program counter in order to function properly. Each individual unit in a timed systolic array computes in "lock-step," meaning that within the course of a single clock cycle, each individual unit finishes alternating stages of computation and communication.
Multi-tasking can not be achieved with a single processor machine. True False 2. Async/Await is best for network bound operations while multi-threading and parallel programming is best for CPU-bound operations. True False 3. The following is a characteristic of an async method:The name of an async method, by convention, ends with an "Async" suffix. True False 4. Using asynchronous code for network bound operations can speed up the time needed to contact the server and get the data back. True False 5. Asynchronous programming has been there for a long time but has tremendously been improved by the simplified approach of async programming in C# 5 through the introduction of: The Task class True False
Question 1 Two processes need to acquire 3 mutexes in order to access a particular shared queue. The mutexes are numerically ordered. Process 1 acquires the mutexes in 1, 2, 3 order and Process 2 acquires them in 3, 2, 1 order. If a process tries to acquire a mutex held by the other process, a conflict is detected, both processes release their mutexes, wait for some (random) time, and try again. Does the proposed scheme guarantee the processes can always successfully access the shared queue? Yes, but at the cost of efficiency Yes, no livelock is possible because the mutexes are numerically ordered No, starvation is possible No, priority inversion is possible
Concurrent Processes / Monitors select which is true options: a CV (condition variable) queues in a monitor store suspended processes waiting on the corresponding condition. b The "Signal and Wait" approach (Hoare semantics) leads to more efficient implementation and reduces the number of context switches. c Two or more processes can be active in the same monitor simultaneously. d When the "Signal and Continue"-approach (Mesa semantics) is applied, the signaling process P continues executing. e The monitor-based solution to the Dining-Philosophers problem discussed in class is restricted to 5 philosophers.
The simulated Pep/9 hardware has 64K of memory. But how is it put to use? So far, just 0x0030 memory has been written. So, what's the deal with all of that additional RAM? Pep/9 knows what to do with each memory location. Another viewpoint Only "global" variables were used. What effect would using "local" variables have? What distinguishes them? (Think "stack").