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. Wh ----

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. Wh ----

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

Consider a memory system which only allows you to do sequential search. For example a read/write tapedrive. If you want to look for a file you have to search sequentially looking at the first file, then the secondfile and so on until you find the file. A reasonable strategy would be place the most recently retrieved fileat the front (imagine that the tape system can magically do this). This way the files that are accessed moreoften will be ”at the front” and require less searching time in the long run. Consider the case with only 3files A, B, and C.1. Let Xn denote the sequence of the memory system after the nth search. For example, if the files wereordered A and then B followed by C, then X0 = ABC. Enumerate the state space.2. If X0 = ABC, list all possible states of X1.3. If pA, pB, and pC = 1 − pA − pB are the probabilities with which files A, B, and C are accessed,respectively, determine the one-step state transition matrix.4. If pA = 0.6, pB = 0.10, pC = 0.3, determine the steady…
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 Printer Scanner Optical drive P1 1 P2 2 1 P3 1 Requests: Magnetic drive 2 Printer Scanner Optical drive P1 1 P2 1 1 P3 2 1 Is there any way that the processes can complete without deadlock? If yes, explain how. If not, explain why not.
: Consider a system that has two processes A and B, each wants to record a scanned document on CD. Process A requests permission to use the scanner and is granted permission. Process B is programmed differently and requests the CD recorder first & is also granted permission. Now A asked for the CD recorder but the request is denied until B releases it. Unfortunately, instead of releasing the CD recorder B asks for the scanner. Answer the following question for given above scenario; Draw the Resource Allocation Graph (RAG) & also determine that there is a deadlock that exists or not. Verify the four sufficient & necessary conditions with reasons. Which one is satisfied or not?
A deadlock occurs when a group of processes is stalled because one process is holding a resource and waiting for another process to obtain it. Consider the situation when two trains are approaching each other on the same track and there is only one track: once they are in front of each other, neither train can proceed. In operating systems, a similar scenario happens when two or more processes possess certain resources while waiting on resources owned by other processes (s). In the picture below, Process 1 is holding Resource 1 and waiting for Process 2 to acquire Resource 2, while Process 2 is waiting for Resource 1. Give an example of a realistic deadlock avoidance approach and describe the basic strategy behind it.
Exercise 2: Draw a State machine Diagram for a Telephone line (a process in a smartphone OS) with the following behavior: When the telephone app is not active, the telephone line is idle. When the app is activated, the line gives a dial tone and can accept the dialing of digits. If after getting the dial tone, the user doesn't dial a number within a time interval of 10 seconds, then a time-out occurs, and the line gets idle again. A button on the app can re- activate the line. After dialing a number, if the number is invalid then a recorded message is played at the end of which the line becomes idle. Upon entry of a valid number, the phone app tries to connect a call & routes it to the proper destination. If the called person answers the phone, the conversation can occur, and the line is in an on- call state. When the called person hangs up, the phone app disconnects and the line goes to the idle state.
Assume a primitive time-sharing operating system is running on a computer with 50,000 32-bit words of main memory, with the resident monitor consuming 10,000 of that. When control is to be assigned to an interactive user, the user’s program and data were loaded into the remaining 40,000 words of main memory. A program is always loaded to start at the location of the 10,000th word; this simplified both the monitor and memory management. Assume that there are four interactive users with the following memory requirements, in words: Job1: 10,000, Job2: 30,000, Job3: 1000, Job4: 5,000 Draw the main memory state diagram considering the following: (a) The monitor loads Job1 and transfers control to it. (b) The monitor decides to load Job2 and transfer control to it. (c) Next, the monitor decides to load Job3 and transfer control to it. (d) Next, the monitor decides to load Job1 and transfer control to it. (e) Next, the monitor decides to load Job4 and transfer control…
Assume a primitive time-sharing operating system is running on a computer with 50,000 32-bit words of main memory, with the resident monitor consuming 10,000 of that. When control is to be assigned to an interactive user, the user’s program and data were loaded into the remaining 40,000 words of main memory. A program is always loaded to start at the location of the 10,000th word; this simplified both the monitor and memory management. Assume that there are four interactive users with the following memory requirements, in words: Job1: 10,000, Job2: 30,000, Job3: 1000, Job4: 5,000 Draw the main memory state diagram considering the following: (a) The monitor loads Job1 and transfers control to it. (b) The monitor decides to load Job2 and transfer control to it. (c) Next, the monitor decides to load Job3 and transfer control to it. (d) Next, the monitor decides to load Job1 and transfer control to it. (e) Next, the monitor decides to load Job4 and transfer control to it.…
Assume a primitive time-sharing operating system is running on a computer with 50,000 32-bit words of main memory, with the resident monitor consuming 10,000 of that. When control is to be assigned to an interactive user, the user’s program and data were loaded into the remaining 40,000 words of main memory. A program is always loaded to start at the location of the 10,000th word; this simplified both the monitor and memory management. Assume that there are four interactive users with the following memory requirements, in words: Job1: 10,000, Job2: 30,000, Job3: 1000, Job4: 5,000 Draw the main memory state diagram considering the following: (a) The monitor loads Job1 and transfers control to it. (b) The monitor decides to load Job2 and transfer control to it. (c) Next, the monitor decides to load Job3 and transfer control to it. (d) Next, the monitor decides to load Job1 and transfer control to it. (e) Next, the monitor decides to load Job4 and transfer control to it.…
Computer monitors are configured in a WIMP fashion. The majority of WIMP configurations have a Desktop metaphor, in which common activities are tied to real-world processes. To relocate a file, pick it up and drag it into a folder or filing cabinet, for example. Give two instances of actions and their corresponding real-world counterparts.
Create a game using the LPC1768 and MBED Application Board running MBED OS 5 or 6. The game must use at least two periodic (time-driven) tasks and one event-driven task, its complexity should be manageable by the given hardware. All tasks must have a visible output. At least two of the tasks must share an output which they could (in theory) access simultaneously so that mutual exclusion must be used to avoid a race condition in your code. The game should include some form of timing
Consider for a minute that you are a software engineer who has invented a system that analyzes photos of a range of recyclable items (such as a can, bottle or a crate). It is accessible through a Web Application Programming Interface (Web API), which allows users to transfer photos over the internet. The system provides, for each photograph, the total number of occurrences of each distinct item shown in the image. Consider if it would be reasonable to give this service for free. Justify your answer
This question is on Process Synchronization in Operating Systems. You need to read the following scenario and find out which Process Synchronization method it resembles with. There are 3 washrooms for men and one for women. Only one person can enter a restroom at a time. When a person leaves the washroom, another person is allowed to enter the washroom. When they are not using the washroom, they are not doing anything. Men are not allowed to use the female washroom. So on a fine rainy day, 9 men arrived and 3 men were allowed to enter the 3 washrooms at a time. They were not allowed to use the female washroom even though it was vacant. What Process Synchronization method has been used here? A) Producer-Consumer B) Readers-Writers C) Dining Philosophers