a. Three processes share four resource units that can be reserved and released only one at a time. Each process needs a maximum of two units. Show that a deadlock cannot occur. b. N processes share M resource units that can be reserved and released only one at a time. The maximum need of each process does not exceed M, and the sum of all maximum needs is less than M + N. Show that a deadlock cannot occur.

a. Three processes share four resource units that can be reserved and released only one at a time. Each process needs a maximum of two units. Show that a deadlock cannot occur. b. N processes share M resource units that can be reserved and released only one at a time. The maximum need of each process does not exceed M, and the sum of all maximum needs is less than M + N. Show that a deadlock cannot occur.

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?
5- Three processes P1, P2 and P3 have Process(arrival time, execution time) as follows. P1(0,7), P2(2,4), P3(3,1). Find the average waiting time for these processes if they are scheduled as Shortest Remaining Time First.
Suggest an efficient scheme for maintaining a per-user protection scheme.That is, the system maintains one directory per user, and that directory lists allthe objects to which the user is allowed access. Your design should address theneeds of a system with 1000 users, of whom no more than 20 are active at anytime. Each user has an average of 200 permitted objects; there are 50,000 totalobjects in the system.
Consider a system with a total of 150 units of memory, allocated to three processes as shown: Process 1 2 3 Max 70 60 60 Hold 45 40 15 Apply the banker's algorithm to determine whether it would be safe to grant each of the following requests. If yes, indicate a sequence of terminations that could be guaranteed possible. If no, show the reduction of the resulting allocation table. 1. A fourth process arrives, with a maximum memory need of 60 and an initial need of 25 units. 2. A fourth process arrives, with a maximum memory need of 60 and an initial need of 35 units.
Every month, Home Alarm System will obtain the log file which record the series of input from all and sample of and sample of logfile is installed sensors. Given the faulty signal is 0001 010100010100100010001101000, < ( (a) Construct DFA diagram which will match the faulty signal and series in the log file.< (b) Trace the output of the sample log file based on the DFA in Question 3 (a) to get the frequency of triggered alarm.< (c) Convert DFA in (a) into a regular expression.<
Last solution had mistakes: For these questions, assume that memory partitions can be subdivided; multiple processes may fit in a partition if there is room. For example, if we had a 30-MB partition and a 20-MB process that fits in the partition, the partition’s new size is 10 MB after placing the process in it. If a second, 8-MB process arrives, we may place it in the partition, leaving 2 MB free in the partition. (The original memory partition then contains a 10-MB and an 8-MB process.) Consider a swapping system where memory has partitions of the following sizes: 180 MB, 100 MB, 40 MB, 200 MB, 300 MB, and 150 MB (in order). For first fit, how are processes of sizes 180 MB, 30 MB, 150 MB, 80 MB, 100 MB, and 70 MB placed (in order)? Indicate which requests (if any) cannot be satisfied. Repeat question (a) for best fit. Repeat question (a) for worst fit.
a)Consider the producer-consumer problem, Assume that the Consumer Process happens to run first and this process is allowed to run for about 10ms (it means that its running time can be very long). Describe what happens and explain any changes to any of the shared variables, and the flow of control (which statements in the Consumer Process execute). b) Assume that the Consumer Process is swapped out, and the Producer Process gets its chance to run, and the Producer Process is allowed to run for about 10ms (it means that its running time can be very long). Describe what happens and explain any changes to any of the shared variables, and the flow of control (which statements in the Consumer Process execute).
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?
a. Three processes share four resource units that can be reserved and released only one at a time. Each process needs a maximum of two units. Show that a deadlock cannot occur. b. N processes share M resource units that can be reserved and released only one at a time. The maximum need of each process does not exceed M, and the sum of all maximum needs is less than M + N. Show that a deadlock cannot occur.
Do
All sub parts please
Asap, incorrect will get multiple downvotes.