A multiprocessor with eight processors has 20 attached tape drives. There is alarge number of jobs submitted to the system that each require a maximum offour tape drives to complete execution. Assume that each job starts running withonly three tape drives for a long period before requiring the fourth tape drive fora short period toward the end of its operation. Also assume an endless supply ofsuch jobs.a. Assume the scheduler in the OS will not start a job unless there are four tape dri-ves available. When a job is started, four drives are assigned immediately and arenot released until the job finishes. What is the maximum number of jobs that canbe in progress at once? What are the maximum and minimum number of tape dri-ves that may be left idle as a result of this policy?b. Suggest an alternative policy to improve tape drive utilization and at the sametime avoid system deadlock. What is the maximum number of jobs that can be inprogress at once? What are the bounds on the number of idling tape drives?

the solution is an given below ;

number of jobs submitted to the system that each require a maximum of tape drives to complete execution. Assume that each job starts running with three tape drives for a long period before requiring the fourth tape drive for rt period toward the end of its operation. Also assume an endless supply of

number of jobs submitted to the system that each require a maximum of tape drives to complete execution. Assume that each job starts running with three tape drives for a long period before requiring the fourth tape drive for rt period toward the end of its operation. Also assume an endless supply of

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 every process requires 3 milli seconds of service time in a system with single processor. If new processes are arriving at the rate of 100 processes per minute, then estimate the fraction of time CPU is busy in system?
Q3) Write the Gannt chart for the following processes using Round Robin (RR) algorithm. Time slice 4ms. Process NO Burst Time PI P2 5 8 P3 12 Р4
Vidyadhar, Rodika, and Manoj write code for a system that requires 4 modules. Each module takes an exponential amount of time to complete with mean 3.0 days. Once a coder is finished with a module, he/she starts another, but only one coder can work on a module. Let {X(t), t >=0} be the CTMC describing the number of modules remaining to code. Show the rate diagram for X Show the Q matrix
Classify the following attributes of a machine as either a property of its microarchitecture or ISA and state the reasoning: (i) (ii) (iii) (iv) (v) The machine does not have a subtract instruction. The ALU of the machine does not have a subtract unit. The machine does not have condition codes. It takes n cycles to execute an ADD instruction. The register file has one input port and two output ports.
In ......... process, both system and surroundings are returned to their initial states at the end of the process Irreversible Process O both wrong Reversible Process O
I need the answer as soon as possible
3. Apply Round Robin Scheduling algorithm to find out the Average Waiting Time, Average Turnaround time using the information given below. Time slice 24 msecs. Process CPU burst time (msec) 106 122 66 98
Design a backup strategy for a computer system. One option is to use plug-in external disks, which cost $150 for each 500 GB drive. Another option is to buy a tape drive for $2500, and 400 GB tapes for $50 apiece. (These were realistic prices in 2008.) A typi- cal backup strategy is to have two sets of backup media onsite, with backups alter- nately written on them so in case the system fails while making a backup, the previous version is still intact. There's also a third set kept offsite, with the offsite set periodi- cally swapped with an on-site set. a. Assume you have 1 TB (1000 GB) of data to back up. How much would a disk backup system cost? b. How much would a tape backup system cost for 1 TB? c. How large would each backup have to be in order for a tape strategy to be less expensive?
A chemical plant needs a microprocessor-drivan alarm system to warn of critical conditions in one of its chemical tanks. The tank has four HIGH/LOW(1/0) switches that monitor teperature (T), prrssure (P), fluid level (L), and weight (W). Design a system that will notify the microprocessor to activate an alarm when any of the following conditions arise: High fluid level with high temperature and high weight. Low fluid level with high temperature and high weight. Low fluid level with low temperature and high pressure. Low fluid level with low weight and high temperature.
Assume in a computer A, the execution time equals 960 ns, CPI of 1.61, and clock rate of3GHz. If the execution time is reduced by additional 10% without affecting the CPI and with aclock rate of 4 GHz, determine the number of instructions.
Home Alarm System company provides the security alarm and central monitoring system specializing for home usage. Every month, they will obtain the log file which record the series of input from all installed sensors. Given the faulty signal is 0001 and sample of logfile is 010100010100100010001101000, (a) Construct DFA diagram which will match the faulty signal and series in the log file. (a) o answer c fast plz (c) Convert DFA in (a) into a regular expression.
The process shown in figure 1 involves pumping fluid from Tank A to Tank B. The operation of the process can be described as follows, Before starting, PS1 must be closed. When the start button is pushed, the pump starts. The button can then be released and the pump continues to operate. When the stop button is pushed, the pump stops. PS2 and PS3 must be closed 8s after the pump starts. If either PS2 or PS3 opens, the pump will shutoff and will not be able to start again for another 15 s. For the above mentioned conditions develop a ladder program using direct method and provide the allocation list. PS1 PS2 PS3 Tank Tank Pump Figure 1 B.