Please answer the following Operating Systems Question and its two parts: Part A: Students working at individual PCs in a computer laboratory send their files to be printed by a server that spools the files on its hard disk. Under what conditions may a deadlock occur if the disk space for the print spool is limited? How may the deadlock be avoided? Part B: According the above scenario, which resources are preemptable and which are nonpreemptable?

Please answer the following Operating Systems Question and its two parts: Part A: Students working at individual PCs in a computer laboratory send their files to be printed by a server that spools the files on its hard disk. Under what conditions may a deadlock occur if the disk space for the print spool is limited? How may the deadlock be avoided? Part B: According the above scenario, which resources are preemptable and which are nonpreemptable?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter2: Introduction To Systems Architecture

Section: Chapter Questions

Problem 19VE

See similar textbooks

Similar questions

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.
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.
In the situation where there are multiple users or a networked computer system, you probably share a printer with other users. When you request to print a file, your request is added to the printer. When your request reaches the front of the printing line, your file is printed. This ensures that only one person at a time has access to the printer and that this access is given on first-come, first-served basis. Keeping that in mind when ever a new request is generated, OS will put the file in line and prints the file which comes earlier(first). After printing the OS checks the next file and prints the next file and this goes on until all files gets printed. Implement the above scenario what you have to do is: Make a File class which keeps Id, name, number of pages.Create a Printer class which takes File type array.The Printer class implements the operation “add” which adds a new file to the line by checking the available space.A remove() method in Printer class which removes the file…
Facts: Facts about Deadlock Deadlock is a situation that occurs in OS when any process enters a waiting state because another waiting process is holding the demanded resource. Deadlock is a common problem in multi-processing where several processes share a specific type of mutually exclusive resource known as a soft lock or software. Deadlock is a situation where a process or a set of processes is blocked, waiting for some other resource that is held by some other waiting process. It is an undesirable state of the system. The following are the four conditions that must hold simultaneously (Links to an external site.) for a deadlock to occur. Mutual Exclusion –A resource can be used by only one process at a time. If another process requests for that resource then the requesting process must be delayed until the resource has been released. Hold and wait –Some processes must be holding some resources in nonshareable mode and at the same time must be waiting to acquire some more…
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.
Compilers and Assemblers build object code files by translating each source file one at a time. As a result, running the object files requires linking them together first. However, it is theoretically feasible to bypass the linking stage and simply build the final executable file from the compilers. What would be the drawbacks of the second option?
Question 3 Consider a system with three users: Alice, Jin and Priya. Each owns files alicerc, jinrc and priyarc correspondingly. Jin and Priya can read alicerc, Priya can read and write jinrc, Alice can read jinrc. Only Alice can read and write alicerc, the file she owns. Assume that each file can be executed by its owner. a. Create the access control matrix that describes the system.b. Create access control lists for all three files.
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.
In a system with fixed partitions, there are 4 partitions available to jobs. Their sizes are 16, 32, 48, and 64 KB. Four jobs executed by the system at the moment have the following sizes: 12, 22, 42, and 55 KB. The amount of internal fragmentation expressed in KB is: نه نه نه نن فم a. b. C. d. e. f. g. h. 0 12 17 25 29 34 41 56
Create a state machine diagram of operating system processes according to the following description: In general, processes are created and are then waiting to be scheduled if they are able to run. They might be blocking on some external condition (IO, semaphores, other synchronization,...) and might be therefore not able to run. If they are scheduled they are running. At any point they can become blocked due to some external condition. Processes can also be swapped out to the page file / swapping space, which can happen when they are waiting for some external condition or when they are waiting to be scheduled. We are assuming that processes can be terminated at any time.
Suppose the OS on your computer uses the Buddy system for memory management. Initially the system has a 1 megabyte (1024K) block of memory managment Show the result of each request. 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 inthe system. (Subject:operating system )
How far (i.e. how far your research goes) can the concept of Mutual Exclusion (ME) be viewed as a required foundation for the efficient operation of an operating system?