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 number of idling tape drives?

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 number of idling tape drives?

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 that you have a program that has a part at the beginning that is sequential in nature (for example, reading a file, that must be executed by only one processor) and takes 20 ms. Also there is a part at the end of the program that is sequential and takes 10 ms. Between these two parts, there is a perfectly parallelizable part and it take 480 ms in sequential. a) What is maximum speed-up according to Amdahl's law? b) What is the speed-up for 4 processors? c) What is the efficiency for 4 processors? Sorunun tüm bölümlerine cevap verin
Suppose we have a system with 50 active processes, P0, P1, ..., P49, some user processes, and some kernel processes. For simplicity, we are not concerned with threads in this question. Ready processes are scheduled to Run by some scheduler. The scheduling algorithm does not matter here. Suppose process P13 makes a disk_read() operating system call. Assume that the completion of disk transfer is signalled by an interrupt from the disk controller. Trace as accurately as you can what happens in the CPU (not the disk) until process P13 has received its requested information from the disk. Hints: The question is about interrupt handling I am looking for a trace of what processes run, why, and what they do. I am not looking for instruction-level explanations. I am not looking for a discussion of disk access, operation, or transfer.
With virtual memory, when a program requests memory,the memory management system does which of the following? Select one: A. It grants the request as long as there is enough physical memory to accommodate B. It looks up the address in the page table. If the address is in memory, then it grants the request. C. It looks up the address in the page table. If the address is in memory, it grants the request. If the address is stored to disk, it writes a section of memory to disk and then transfers the requested virtual memory address from disk to main memory. D. It causes a deadlock to occur.
Computer Science A multiprogrammed system with a single CPU has a very large number of CPU boundprocesses running on it that all have the same priority. Could you think of a CPU schedulingalgorithm that would combine the lowest possible response times with the highest possiblethroughput and no starvation
The running time needed to determine if the edge (u, v) belongs to the set of edges E and the graph represented by an adjacency list: a. O((V) O b. O(degree(u)) О с. O(IE) O d. O(V + JE)
In a multiprogrammed environment with 32MB of RAM where all processes require9MB of unshared RAM and spend 40% of their time in I/O wait, calculate themaximum achievable CPU utilization. If the RAM available is increased by 700%and time spent in I/O wait increases by 100%, calculate how much RAM will remainunused when CPU utilization is just above 99%.
Imagine that you have implemented an algorithm in a program which has 40% parallelizable code. Now consider the following two cases assuming that scheduling overhead is ignored: -The program is executed on a single processor. -The program is executed on a parallel system with 4 processors. Compute the speed-up gained in the case where multiple processors are used.
9. You are shown the diagram of memory with some processes and size of each process in memory as well as the size of free memory. When a new process comes, it must be allocated space in one of the free memory spaces: Freel to Free4. Operating System 160 Process A 355 Freel 430 Free2 600 Process B 790 Process C 885 Free3 920 Free4 1024 A new process comes whose size is 80 bytes. In which of the free memory slots will the process go a. if you use first-fit storage-allocation? b. if you use best-fit storage-allocation? c. if you use worst-fit storage-allocation? i)
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…
There are three user processes in the OS, and they all use R in equal amounts (two for each). The operating system consumes a total of 12 R instances. The smallest number of R-units that may be employed while yet guaranteeing that no deadlocks would occur is
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…