Consider a system with 13 dedicated devices of the same type and all jobs currently running on this system require a maximum of three devices to complete their execution but they each run for long periods of time with just two devices and request the remaining one only at the very end of the run. Assume that the job stream is endless and that your operating system’s device allocation policy is a very conservative one: No job will be started unless all the required drives have been allocated to it for the entire duration of its run. a. What is the maximum number of jobs that can be in progress at once? Explain your answer. b. Explain what are the minimum and maximum numbers of devices that may be idle as a result of this policy. c. Under what circumstances an additional job would be started?

Consider a system with 13 dedicated devices of the same type and all jobs currently running on this system require a maximum of three devices to complete their execution but they each run for long periods of time with just two devices and request the remaining one only at the very end of the run. Assume that the job stream is endless and that your operating system’s device allocation policy is a very conservative one: No job will be started unless all the required drives have been allocated to it for the entire duration of its run. a. What is the maximum number of jobs that can be in progress at once? Explain your answer. b. Explain what are the minimum and maximum numbers of devices that may be idle as a result of this policy. c. Under what circumstances an additional job would be started?

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

Consider a system with 13 dedicated devices of the same type. All jobs currently running on this system require a maximum of three devices to complete their execution, but they each run for long periods of time with just two devices and request the remaining one only at the very end of the run. Assume that the job stream is endless and that your operating system's device allocation policy is a very conservative one: no job will be started unless all the required drives have been allocated to it for the entire duration of its run. a. What is the maximum number of jobs that can be in progress at once? Explain your answer. b. What are the minimum and maximum number of devices that may be idle as a result of this policy? Under what circumstances would an additional job be started?
Consider a system with 14 dedicated devices of the same type. All jobs currently running on this system require a maximum of five devices to complete their execution but they each run for long periods of time with just three devices and request the remaining two only at the very end of the run.Assume that the job stream is endless and that your operating system’s device allocation policy is a very conservative one: No job will be started unless all the required drives have been allocated to it for the entire duration of its run. What are the minimum and maximum number of devices that may be idle because of this policy?
Consider a system with 14 dedicated devices of the same type. All jobs currently running on this system require a maximum of five devices to complete their execution but they each run for long periods of time with just three devices and request the remaining two only at the very end of the run.Assume that the job stream is endless and that your operating system’s device allocation policy is a very conservative one: No job will be started unless all the required drives have been allocated to it for the entire duration of its run. a. What is the maximum number of jobs that can be active at once?
Consider a system with 13 dedicated devices of the same type and all jobs currently running on this system require a maximum of three devices to complete their execution but they each run for long periods of time with just two devices and request the remaining one only at the very end of the run. Assume that the job stream is endless and that your operating system’s device allocation policy is a very conservative one: No job will be started unless all the required drives have been allocated to it for the entire duration of its run. a. What is the maximum number of jobs that can be in progress at once? Explain your answer. b.Explain what are the minimum and maximum numbers of devices that may be idle as a result of this policy. c. Under what circumstances an additional job would be started?
A multiprocessor with eight processors has 20 attached tape drives. There is a large number of jobs submitted to the system that each require a maximum of four tape drives to complete execution. Assume that each job starts running with only three tape drives for a long period before requiring the fourth tape drive for a short period toward the end of its operation. Also assume an endless supply of such 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 are not released until the job finishes. What is the maximum number of jobs that can be 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 same time avoid system deadlock. What is the maximum number of jobs that can be in progress at once? What are the bounds on the…
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
A multiprocessor with eight processors has 20 attached tape drives. There is a large number of jobs submitted to the system that each require a maximum of four tape drives to complete execution. Assume each job starts running with only three tape drives for a long period before requiring the fourth tape drive for a short period toward the end of its operation. Also assume an endless supply of such jobs. 1. Assume the scheduler in the OS will not start a job unless there are four tape drives available. When a job is started, four drives are assigned immediately and are not released until the job finishes. What is the maximum number of jobs that can be in progress at once? What are the maximum and minimum number of tape drives that may be left idle as a result of this policy? 2. Suggest an alternative policy to improve tape drive utilization and at the same time avoid system deadlock. What is the maximum number of jobs that can be in progress at once? What are the bounds on the number of…
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?
You are told that a given system uses Segmentation. The memory is currently full and holds 3 processes "A", "B" and "C" each of size 512KB as well as the kernel whose size is 1024KB. You can assume there is nothing else that is taking up memory. A Timer Interrupt forces a context switch to occur and the scheduler chooses to load process "B" into the CPU and change its state to running. You are told that the base of the stack which grows upwards for processB is found at the very end of our physical memory. You are also told that the last portion of the Address Space for each process is used for the Stack. After the Context switch which process does the values in the segment register correspond to? C + x What is the Physical Address of the base of the stack for ProcessB? (Just give the value in KB) 1536 What is the offset of the Virtual Address 500KB in KB? (Just give the value) 32 What is the Physical Address that the Virtual Address 500KB maps to in KB? (Just give the value) 1524
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.
A program repeatedly perform the 3steps process: it reads a 4KB block of data from disk, does some processing on the data and then writes out the results as another 4KB block elsewhere on the disk. Each block is contiguous and randomly located on a single track on the disk. The disk drive rotates at 10000RPM, has an average seek time of 8ms, and has a transfer rate of 50MB/sec. The controller overhead is 2ms. The processing step tales 20million clock cycles and the clock rate is5 GHz. What is the overall speed of the system in blocks processed per second?
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