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?

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

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 11P

See similar textbooks

Similar questions

A multiprocessor with 10 processors has 36 attached tape drives. A number of jobshave been submitted to the system where each job requires a maximum of 6 drives inorder to complete execution. Assume that each job starts running with only 4 drivesfor a long period before requiring the other 2 drives for a short period toward theend of its operation. Also assume an endless supply of those jobs.Assume the scheduler in the operating system will not start a job unless there are 6tape drives available. When a job is started, 6 drives are assigned immediately andare not released until the job finishes.What is the maximum number of jobs that can be in progress at once?What is the maximum number of tape drives that may be left idle as a result of this policy?What is the minimum number of tape drives that may be left idle as a result of this policy?
A multiprocessor with 10 processors has 36 attached tape drives. A number of jobshave been submitted to the system where each job requires a maximum of 6 drives inorder to complete execution. Assume that each job starts running with only 4 drivesfor a long period before requiring the other 2 drives for a short period toward theend of its operation. Also assume an endless supply of those jobs.Assume the scheduler in the operating system will not start a job unless there are 6tape drives available. When a job is started, 6 drives are assigned immediately andare not released until the job finishes.5.1 What is the maximum number of jobs that can be in progress at once? 5.2 What is the maximum number of tape drives that may be left idle as a result of this policy?5.3 What is the minimum number of tape drives that may be left idle as a result of this policy?
A multiprocessor with 10 processors has 36 attached tape drives. A number of jobs have been submitted to the system where each job requires a maximum of 6 drives in order to complete execution. Assume that each job starts running with only 4 drives for a long period before requiring the other 2 drives for a short period toward the end of its operation. Also assume an endless supply of those jobs. Assume the scheduler in the operating system will not start a job unless there are 6 tape drives available. When a job is started, 6 drives are assigned immediately and are not released until the job finishes. 5.1 What is the maximum number of jobs that can be in progress at once? 5.2 What is the maximum number of tape drives that may be left idle as a result of this policy? 5.3 What is the minimum number of tape drives that may be left idle as a result of this policy?
An octa-core processor has 83 attached tape drives. There is a large number of jobs submitted to thesystem that each of them requires a maximum of 5 tape drives to complete execution. Assume each jobstarts running with only 4 tape drives for a long period before requiring the 5th tape drive for a short periodtowards the end of its operation. When a job is started, 5 drives are assigned immediately and are notreleased until the job finishes. Assume that the scheduler in the OS will not start a job unless there are 5tape drives available. Also assume an endless supply of such jobs.a)What is the maximum number of jobs that can be in progress at once? (1 point)b)Compute the maximum and minimum number of tape drives that may be left idle as a result of this policy
Assume a memory management module supporting system for the placement of 1 MB memory.Allocate the following requests [the requests are coming one after the other in the same order).Clearly mention all the requests which you could not allocate.Request 1: Allocate 7OKBRequest 7: Allocate 300KBRequest 2: Allocate 14KBRequest 8: Allocate 46KBRequest 3: Allocate 100KBRequest 9: Allocate 62KBRequest 4: Allocate 140KBRequest10: Release 100KB [Allocated by request 3]
A multicore processor with 4 cores has 15 attached ta pe drives. There is a large number of jobs submitted to the system that each requires exactly 4 tape drives to complete execution. Assume that each job runs on 4 tapes for the entire duration of its execution. Also assume an endless supply of such jobs. The scheduler in the operating system will not start a job unless there are 4 tape drives available. When a job is started, 4 drives are utilized immediately for its execution and are not released until the job finishes. a) What is the maximum number of jobs that can be in progress at once? b) What are the maximum and minimum number of tape drives that may be left idle at a given time as a result of this policy?
Suppose the OS on your computer uses the Buddy system for memory management. Initially the system has a 1 megabyte (1024K) block of memory available. Show the result of each request/release via successive figures similar to the one illustrated in the lecture slides. A: Request 25 K B: Request 500 K C: Request 70 K D:Request 100 K E: Request 40 K Release A F: Request 20 K Release B After memory is allocated to process F, how much internal fragmentation exist in the system.
Consider a computer with N processors in a multiprocessor configuration. a. How many processes can be in each of the Ready, Running, and Blocked states at one time? b. What is the minimum number of processes that can be in each of the Ready, Running, and Blocked states at one time?
Assume a memory management module supporting system for the placement of 1 MB memory. Allocate the following requests [the requests are coming one after the other in the same order]. Clearly mention all the requests which you could not allocate. Request 1: Allocate 70KB Request 7: Allocate 300KB Request 2: Allocate 14KB Request 3: Allocate 100KB Request 4: Allocate 140KB Request 5: Allocate 190KB Request 6: Release 140KB [Allocated by request 4] After finishing all the requests (A) Draw the final tree representation of the system. (b) Find the total free space available in the system for allocation (c) Find the total internal fragmentation caused because of all the allocation Request 8: Allocate 46KB Request 9: Allocate 62KB Request10: Release 100KB [Allocated by request 3] Request11: Allocate 180KB
multicore processor with 4 cores has 15 attached tape drives. There is a large number of jobs submitted to the system that each requires exactly 4 tape drives to complete execution. Assume that each job runs on 4 tapes for the entire duration of its execution. Also assume an endless supply of such jobs. The scheduler in the operating system will not start a job unless there are 4 tape drives available. When a job is started, 4 drives are utilized immediately for its execution and are not released until the job finishes. a) What is the maximum number of jobs that can be in progress at once? b) What are the maximum number of tape drives that may be left idle at a given time as a result of this policy? c) What are the minimum number of tape drives that may be left idle at a given time as a result of this policy?
There are a total of three user processes running in an OS, and each of them uses up two instances of the resource R. An absolute minimum of R units must be employed to avoid deadlocks, and this minimum is
Computer Science I'm working on project about building an operating system simulator and in the description of the project under the section about I/O management, the requirement is two typed of I/O event must be handled. One come from a process and the other one come from external (e.g hardware peripherals) which may happen at moment and caused by process being executed by CPU. So I dont really know what to do here? is it asking to implement some kind of disk scheduling algorithms? im doing the project in python btw