d. Figure 1 illustrates the times at which 10 different processes run on a single core of a single CPU. Every "row" represents a different process. The times increase towards the right, and processes with a higher priority are shown on top of the figure, processes with a lower lower priority at the bottom of the chart. i. Is the scheduler preemptive or non-preemptive? i. Would this scheduler most suitable for an interactive system or a batch processing system? . Would deadlocks due to inversion of control be possible for the given system (yes / no)? iv. Which process scheduling algorithm could be used to generate the timings shown?

d. Figure 1 illustrates the times at which 10 different processes run on a single core of a single CPU. Every "row" represents a different process. The times increase towards the right, and processes with a higher priority are shown on top of the figure, processes with a lower lower priority at the bottom of the chart. i. Is the scheduler preemptive or non-preemptive? i. Would this scheduler most suitable for an interactive system or a batch processing system? . Would deadlocks due to inversion of control be possible for the given system (yes / no)? iv. Which process scheduling algorithm could be used to generate the timings shown?

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

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.
assume a system has 6 identical resources and N processes competing for them. each process can request at most 2 resources. what is the maximum value of N for the system to be deadlock free?
Consider 4 processes P0, P1, P2 and P3 that need to share 3 resource types A (10 instances), B(6 instances) and C (7 instances). The allocation of resources and the maximum need for 4processes as mentioned in the table.
On page 4 Experience with Processes and Monitors in Mesa, Lampson and Redell state the following: "For mutual exclusion with a preemptive scheduler, it is necessary to introduce explicit locks, and machinery that makes requesting processes wait when a lock is unavailable. We considered casting our locks as semaphores, but decided that, compared with monitors, they exert too little structuring discipline on concurrent programs." How do semaphores "exert too little structuring discipline" and how is this remedied by monitors? Construct an example to show how the structuring discipline exerted by monitors could be useful.
Consider a computer system with 3 processes and one resource with 4 instances. Each process needs at most 2 resource instances. Is a deadlock possible in this system? Justify your answer.
5. A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Then a. deadlocked state is unsafe b. unsafe state may lead to a deadlock situation c. deadlocked state is a subset of unsafe state d. all of these
4. With a single resource, deadlock occurs a. if there are more than two processes competing for that resource b. if there are only two processes competing for that resource c. if there is a single process competing for that resource d. none of these
Those who have come to a standstill due to the detection of deadlocks in their processes are permitted to make resource requests.
There are 3 resources R1, R2 and R3 with one instance each and three processes P1, P2 and P3 in an operating system. A snapshot of the system resource allocation graph shows the following: R1 is allocated to P2; R2 is allocated to P1; R3 is allocated to P3; P1 requests R1; P2 requests R3; P3 requests R2. Which of the following is true about this system? answer ) a)Undetermined b)There is deadlock in the system c)Deadlock will never happen d)There is no deadlock in the system
We are dealing with 6 processes p1;p2; : : : ;p6:(a) Processes p1;p2 in p3 arrive at time 2 ms, respectively. Each of those processesneeds 5 ms of CPU time.(b) Process p4 arrives at time 10 ms and needs 3 ms of CPU time.(c) Processes p5 in p6 arrive at time 19 ms. Process p5 needs 7 ms, while process p6needs 4 ms of CPU time.Scheduling is preemptive, where there process switch takes 1 ms. For the Round-Robinalgorithms with quantum 2 ms illustrate the execution of those processes on a timeline.Then determine the average turnaround time.
A system has three processes (P1,P2, P3) and three resources (R1,R2, R3). There is one instance of R1 and R2. There are three instances of R3. P1 holds an R1 and is requesting an R3. P2 holds an R3 and is requesting an R1. P3 holds two instances of R3 and an R2. Does a deadlock exist? Justify your answer.
a) For what reason is synchronization important among processes when every one of them are executing on a single CPU machine and just one of them can really execute at any one moment?b) There are several way to design an operation system but let suppose an organization need to design an operating system for their server machine and multiple user will be allowed to access the resources through network. Which technique would you like to suggest to design process communication module? What is the advantages of your selected technique? Explain your answer briefly.c) From the given scenario in part(b), which treading model allows system to run an application that fetches data continuously and simultaneously over network? Justify your answer.