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

3. Job Scheduling: Consider the problem of scheduling n jobs of known durations t1, t2, ..., tn, for execution by a single processor. The jobs can be executed in any order, one job at a time. You want to find a schedule that minimizes the total time spent by all the jobs in the system. (The time spent by one job in the system is the sum of the time spent by this job in waiting plus the time spent on its execution.) Design a greedy algorithm for this problem. Does the greedy algorithm always yield an optimal solution?
true/false Consider a group of CPU-time sharing processes P1 , P2, ... Pn with CPU burst times of 1,2,...,n units respectively arrive at the same time. The average waiting time of these processes is always less than n2/6 (regardless of scheduling algorithm)
Please refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles,”7th Edition, John Wiley & Sons Inc., 2006.” And answer the following questions: Question7: A practical way to handle network partitioning is to: (a) Have each process start an election. (b) Elect a leader only if a majority of nodes can be reached. (c) Run a normal election and multicast the result to the subset of processes that can be reached. (d) Divide and conquer: elect multiple coordinators.
Suppose a program segment consists of a purely sequential part which takes 100 cycles to execute, and an iterated loop which takes 400 cycles per iteration. Assume that the loop is dependent on the sequential part, i.e., both parts cannot run in parallel. Also assume that the loop iterations are independent, and cannot be further parallelized. If the loop is to be executed 100 times, what is the maximum speedup possible using an infinite number of processors (as many processors as you could possibly need) compared to a single processor?
One kind of machine that uses MISD is a systolic array. A systolic array is a network of data processing units organized as a pipeline, or "wavefront." No program counter is required since execution is kicked off by the arrival of new data. In a timed systolic array, all of the nodes calculate "in lock-step," with each node finishing its turn at the clock after completing its turn at the alternating phases of computation and communication.
Implement SRTF (SJF with preemption) scheduling algorithm in C programming. NOTE: Please do not print the average waiting time and the average turnaround time. You are required to compute these for each process and print the values for each process separately. Add comments in the code so that the code is understandable. Take input from the user: the number of processes, their CPU burst times and arrival times for n number of processes. Compute and print the completion Time(CT), Turnaround Time(TAT), and Waiting Time(WT) for each process using C Programming
Servers can be designed to limit the number of open connections. A typical example, a server may wish to have only N socket connections at any point in time. As soon as N connections are made, the server will not accept another incoming connection until an existing connection is released. 4.4 Show how to implement the wait() and signal() semaphore operations in multiprocessor environments using the TestAndSet() instruction. The solution should exhibit minimal busy waiting.
Single instruction computer (SIC) has only one instruction that for all operations our MIPS does. The instruction has the following format. sbn a, b, c # Mems[a]=Mem[a]- Mem[b]; if (Mem[a]<0) go to PC+c For example, here is the program to copy a number from location a to location b: Start: sbn temp, temp, 1 sbn temp, a, 1 sbn b, b, 1 sbn b, temp, 1 So build SIC program to add a and b, leaving the result in a and leaving b unmodified.
Do execution paths 3 and 4 encompass the first three conditions for a deadlock to occur?
Find an assembly line scheduling using dynamic programming source codes (Java programming language) from Internet. Modify the codes to handle random generate of input for different number of stations. Add counters to count the primitive operations performed. Draw a graph that shows f(n) and n, where f(n) is the total number of primitive operations performed, n is the number of stations. Discuss the time complexity of the algorithm in term of best case, worst case and average case.
Consider a computer running a program that requires 250 seconds, where 70 seconds is spent executing FP instructions, 55 seconds for INT operations, 85 seconds for load/save operations, and 40 seconds for branch instructions. By how much is the time for INT operations reduced if the total time is reduced by 20%?
Suppose that DS=1000H, SS= 2000H, CS=3000H, ES=4000H, BP=FFH, BX=FFFFH and DI=5H.i. Which memory locations are addressed by: MOV DL, [BP]?ii. Which memory locations are addressed by: MOV EAX, [BX+DI]?