January 2021

1.Give examples of reusable and consumable resources. 2. What are the three conditions that must be present for deadlock to be possible? 3. What are the four conditions that create deadlock? 4. How can the hold-and-wait condition be prevented? 5. List two ways in which the no-preemption condition can be prevented. 6. How can the […]

1.What is the difference among deadlock avoidance, detection, and prevention? 6.1 Show that the four conditions of deadlock apply to Figure 6.1a. 2. Show how each of the techniques of prevention, avoidance, and detection can be applied to Figure 6.1. 3. For Figure 6.3, provide a narrative description of each of the six depicted paths,

1.Suggest an additional resource constraint that will prevent the deadlock in Problem 2. but still permit the boundary between input and output buffers to vary in accordance with the present needs of the processes. 3. In THE multiprogramming system [DIJK68], a drum (precursor to the disk for secondary storage) is divided into input buffers, processing

1.Comment on the following solution to the dining philosophers problem. A hungry philosopher first picks up his left fork; if his right fork is also available, he picks up his right fork and starts eating; otherwise he puts down his left fork again and repeats the cycle. 2. Suppose that there are two types of

Identity has been a constant topic of discussion in contemporary Hong Kong Cinema. Discuss how Infernal Affairs addresses the issue of identity in its Postmodern settings. Pay attention to the difficult identities of the two main characters and how they negotiate and struggle with their identities. Explain how their complicated relationship to their identities comment

Repeat Problem 10.3d for the execution profiles of Table 10.7b. Comment on the results. 2. Maximum urgency first (MUF) is a real-time scheduling algorithm for periodic tasks. Each task is assigned an urgency that is defined as a combination of two fixed priorities and one dynamic priority. One of the fixed priorities, the criticality, has

1.Repeat Problem 10.4, adding MUF to the diagrams. Comment on the results. 2. This problem demonstrates that, although Equation (10.2) for rate monotonic scheduling is a sufficient condition for successful scheduling, it is not a necessary condition [that is, sometimes successful scheduling is possible even if Equation (10.2) is not satisfied].a. Consider a task set

1.Draw a diagram similar to that of Figure 10.10b that shows the sequence events for this same example using priority ceiling. Review Questions 2. List and briefly define three techniques for performing I/O. 3. What is the difference between logical I/O and device I/O? 4. What is the difference between block-oriented devices and stream-oriented devices?

1.Why would you expect improved performance using a double buffer rather than a single buffer for I/O? 2. What delay elements are involved in a disk read or write? 3. Briefly define the disk scheduling policies illustrated in Figure 11.7. 4. Briefly define the seven RAID levels. 5. What is the typical disk sector size?

1.Consider a program that accesses a single I/O device and compare unbuffered I/O to the use of a buffer. Show that the use of the buffer can reduce the running time by at most a factor of two. Generalize the result of Problem 11.1 to the case in which a program refers to n devices.