Question

4.7 A multiprocessor with eight processors has 20attached tape drives. There is a large number of jobs submitted tothe system that each require a maxi

Other
ANSWERED
asked 2021-05-12
4.7 A multiprocessor with eight processors has 20attached tape drives. There is a large number of jobs submitted tothe system that each require a maximum of four tape drives tocomplete execution. Assume that each job starts running with onlythree tape drives for a long period before requiring the fourthtape drive for a short period toward the end of its operation. Alsoassume an endless supply of such jobs.
a) Assume the scheduler in the OS will not start a job unlessthere are four tape drives available. When a job is started, fourdrives are assigned immediately and are not released until the jobfinishes. What is the maximum number of jobs that can be inprogress at once? What is the maximum and minimum number of tapedrives that may be left idle as a result of this policy?
b) Suggest an alternative policy to improve tape driveutilization and at the same time avoid system deadlock. What is themaximum number of jobs that can be in progress at once? What arethe bounds on the number of idling tape drives?

Answers (1)

2021-05-14

At most \(20/4 =5\) processes can be active at any one point in time. Since, at most one of those drives can be idle in each process, at most 5 drives could be idle. It is also possible that no drives are idle, as all processes are using their full complement at that point in time.
(b) Allocate the last drive for each process “upon demond”, thus, each process would start with 3 drives. This means that \(20/3 =6\) processes could be active at any time. The minimum number of drives available would still be 0, but the maximum would be 2.
Note that the fact that there could only be 2 drives indicates that a seventh process could not start, and there is no dead lock resulting.

0
 
Best answer

expert advice

Have a similar question?
We can deal with it in 3 hours

Relevant Questions

asked 2021-03-24
A 2.4-kg object is attached to a horizontal spring of forceconstant k=4.5 kN/m. The spring is stretched 10 cm fromequilibrium and released. Find (a) the frequency of themotion, (b) the period, (c) the amplitude, (d) the maximum speed,and (e) the maximum acceleration. (f) When does the objectfirst reach its equilibrium position? What is itsacceleration at this time?
Two identical blocks placed one on top of the other rest on africtionless horizontal air track. The lower block isattached to a spring of spring constant k= 600 N/m. Whendisplaced slightly from its equilibrium position, the systemoscillates with a frequency of 1.8 Hz. When the amplitude ofoscillation exceeds 5 cm, the upper block starts to slide relativeto the lower one. (a) What are the masses of the twoblocks? (b) What is the coefficient of static frictionbetween the two blocks?
asked 2021-03-24
The flywheel of a punch press has a moment of inertia of \(\displaystyle{16.0}{k}{g}\cdot{m}^{{2}}\) and runs at 300 rev/min. The flywheel supplies all theenergy needed in a quick punching operation.
a)Find the speed in rev/min to which the fly wheel will be reducedby a sudden punching operation requiring 4000J of work.
b)What must the constant power supply to the flywheel (in watts) beto bring it back to it's initial speed in a time of 5.00 s?
asked 2021-02-25
We will now add support for register-memory ALU operations to the classic five-stage RISC pipeline. To offset this increase in complexity, all memory addressing will be restricted to register indirect (i.e., all addresses are simply a value held in a register; no offset or displacement may be added to the register value). For example, the register-memory instruction add x4, x5, (x1) means add the contents of register x5 to the contents of the memory location with address equal to the value in register x1 and put the sum in register x4. Register-register ALU operations are unchanged. The following items apply to the integer RISC pipeline:
a. List a rearranged order of the five traditional stages of the RISC pipeline that will support register-memory operations implemented exclusively by register indirect addressing.
b. Describe what new forwarding paths are needed for the rearranged pipeline by stating the source, destination, and information transferred on each needed new path.
c. For the reordered stages of the RISC pipeline, what new data hazards are created by this addressing mode? Give an instruction sequence illustrating each new hazard.
d. List all of the ways that the RISC pipeline with register-memory ALU operations can have a different instruction count for a given program than the original RISC pipeline. Give a pair of specific instruction sequences, one for the original pipeline and one for the rearranged pipeline, to illustrate each way.
Hint for (d): Give a pair of instruction sequences where the RISC pipeline has “more” instructions than the reg-mem architecture. Also give a pair of instruction sequences where the RISC pipeline has “fewer” instructions than the reg-mem architecture.
asked 2021-06-10
Here’s an interesting challenge you can give to a friend. Hold a $1 (or larger!) bill by an upper corner. Have a friend prepare to pinch a lower corner, putting her fingers near but not touching the bill. Tell her to try to catch the bill when you drop it by simply closing her fingers. This seems like it should be easy, but it’s not. After she sees that you have released the bill, it will take her about 0.25 s to react and close her fingers-which is not fast enough to catch the bill. How much time does it take for the bill to fall beyond her grasp? The length of a bill is 16 cm.
...