Consider a computer environment in which there are 4 magnetic drives, 2 printers, 3 scanners, and 1 optical drive. Three processes P1, P2, P3 are using these resources. At any point in time, the allocations and requests for these resources are as follows. Allocations: Magnetic drive Printen Scanner Optical drive P1 P2 P3 1 2 Requests: Printer Scanner Magnetic drive 2 Optical drive P1 P2 P3 1 To 2 1 Is there any way that the processes can complete without deadlock? If yes, explain how. If not, explain why not.

Consider a computer environment in which there are 4 magnetic drives, 2 printers, 3 scanners, and 1 optical drive. Three processes P1, P2, P3 are using these resources. At any point in time, the allocations and requests for these resources are as follows. Allocations: Magnetic drive Printen Scanner Optical drive P1 P2 P3 1 2 Requests: Printer Scanner Magnetic drive 2 Optical drive P1 P2 P3 1 To 2 1 Is there any way that the processes can complete without deadlock? If yes, explain how. If not, explain why not.

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

For Heap File with a page directory, assume that a page can contain up to 100 directory entries and a page can contain 1000 records, for a file of 1,000,000 records, what is the number of pages to store these records, assuming that on average data pages are filled up 70%? With this data page utilization, what is the number of pages to store the directory, assuming that each directory page is full? Assuming both the directory and the file are stored on disk, what is the I/O cost to insert one record in worst case, and in the average case?
Consider user accounts on a computer system with a Web server configured to provide user Web areas. In general, this uses a standard directory name, such as “public_html,” in a user’s home directory. However, access control needs to be properly set to allow users (with or without user accounts on the system) to browse the webpages. Assuming there are one main page (index.html), two pictures files (a.jpg and b.jpg) stored in an sub-directory (Image) and one pdf file (c.pdf) stored in an sub-directory (Doc), all under the public_html. (a) Specify the access matrix for each directory (excluding home directory) and files that allows everyone to view the webpage. (b) Draw a directed graph that represented to the access matrix
In a computer system five processes are attempting to proceed with three resource types. The total units of system resources are: (8,9,7). The maximum demands for every process are: P1(3,1,1), P2(3,3,2), P3(5,3,2), P4(5,1,2), P5(8,4,3). The current allocation is: P1 (0,1,1), P2 (2,1,1), P3 (3,1,2), P4 (1,1,1), and P5 (2,3,2). Is this state a safe state? Explain your answer. Please explain in great detail so i can understand .
Suppose that an operating system supports two kinds of sequential processes: high-priority interactive processes, and low-priority non-interactive processes. The behavior of the high-priority processes is to alternate between periods of computation of duration Tc and periods of blocking (waiting for input) of duration Tb. The behavior of the low-priority processes is to compute constantly, with no blocking. The operating system’s scheduling policy is round-robin with a quantum q, where Tc < q. Scheduling decisions are made only when a quantum expires, or when the running process blocks. The scheduler selects a low-priority process to run only if no high-priority processes are ready. Suppose there is one high-priority process and one low-priority process in the system, and that both processes will run for a long time. For what fraction of the time does the low-priority process run?
Suppose a system has 5 processes, P = {P1, P2, P3, P4, P5}, and 4 resources, R = {R1, R2, R3, R4}, where there are 2 instances of R1, 1 instance of R2, 3 instances of R3, and 3 instances of R4. The current state of the system is defined by the following requests and assignments: P1 is requesting an instance of R3 and has been assigned an instance of R2; P2 is requesting an instance of R1 and has been assigned an instance of R3; P3 is requesting an instance of R4 and has been assigned an instance of R1 and an instance of R3; P4 is requesting an instance of R3; P5 is requesting an instance of R2 and has been assigned an instance of R4. Is there deadlock in this system? (Explicitly state yes, there’s deadlock or no, there isn’t.) If applicable, draw a wait-for graph or resource-allocation graph, and use the appropriate graph to justify your answer. If you conclude there is no deadlock, your justification should contain a sequence of execution for the processes which shows that…
Given an instruction sequence with instructions in classes A, B, and C as the table below: Instruction Class A B C |CPI Instruction Count|10|40|10| 2 1 3 Total number of instructions in this sequence = Number of clock cycles from instruction class A = Number of clock cycles from instruction class B = Number of clock cycles from instruction class C = Total number of clock cycles = Average CPI for this instruction sequence = (Answer with a float the decimal point, e.g. 4.5)
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Ý, and Z to three processes PO, P1, and P2. The table given below presents the current system state. There are 3 instances of type X, 2 instances of type Y and 2 instances of type Z still available. The system is currently in a safe state. Answer the following questions! Allocation Max X Y z X Y PO 0 1 8 4 3 (a) If PO requests 2 instances of Z during the P1 3 2 current state, can it be granted? Explain! (b) If P1 requests 2 instances of X during the P2 2 1 1 3 3 3 current state, can it be granted? Explain! CO
COURSE Operating System Only correct answer will be upvoted. Else downvoted.
Q3: Suppose there is a processing unit composed by CPU and I/O component. For a specific task, CPU takes 5 second to finish the execution and I/O takes 2 second to process. The communication time between CPU and I/O can be elimiate under this circumstance. Execution Time 7 second 5second 2 second CPU time I/O time If CPU time decreases by 25% per year for 3 years and I/O time decreases by 20% per year 1) How many times faster is this program after 3 years? 2) What percentage of new time is I/O? and what percentage of new time is CPU?