Recent questions without answers

0 votes

0 answers

1

Galvin Edition 9 Exercise 7 Question 20 (Page No. 343)
Consider again the setting in the preceding question. Assume now that each philosopher requires three chopsticks to eat. Resource requests are still issued one at a time. Describe some simple rules for determining whether a particular request can be satisfied without causing deadlock given the current allocation of chopsticks to philosophers.

asked 9 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 4 views

0 votes

0 answers

2

Galvin Edition 9 Exercise 7 Question 19 (Page No. 343)
Consider the version of the dining-philosophers problem in which the chopsticks are placed at the center of the table and any two of them can be used by a philosopher. Assume that requests for chopsticks are ... whether a particular request can be satisfied without causing deadlock given the current allocation of chopsticks to philosophers.

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 2 views

0 votes

0 answers

3

Galvin Edition 9 Exercise 7 Question 18 (Page No. 343)
Consider a system consisting of $m$ resources of the same type being shared by $n$ processes.Aprocess can request or release only one resource at a time. Show that the system is deadlock free if the following two conditions hold: a. The maximum ... is between one resource and $m$ resources. b. The sum of all maximum needs is less than $m + n$.

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 2 views

0 votes

0 answers

4

Galvin Edition 9 Exercise 7 Question 17 (Page No. 343)
Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock free.

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 2 views

0 votes

0 answers

5

Galvin Edition 9 Exercise 7 Question 16 (Page No. 342-343)
In a real computer system, neither the resources available nor the demands of processes for resources are consistent over long periods (months). Resources break or are replaced, new processes come and go, and new resources are bought ... not need that many resources). e. Increase the number of processes. f. Decrease the number of processes.

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 2 views

0 votes

0 answers

6

Galvin Edition 9 Exercise 7 Question 15 (Page No. 342)
Compare the circular-wait scheme with the various deadlock-avoidance schemes (like the banker’s algorithm) with respect to the following issues: a. Runtime overheads b. System throughput

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 3 views

0 votes

0 answers

7

Galvin Edition 9 Exercise 7 Question 13 (Page No. 341)
... t always lead to deadlock. Describe what role the $CPU$ scheduler plays and how it can contribute to deadlock in this program.

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 1 view

0 votes

0 answers

8

Galvin Edition 9 Exercise 7 Question 12 (Page No. 341)
Assume a multithreaded application uses only reader–writer locks for synchronization. Applying the four necessary conditions for deadlock, is deadlock still possible if multiple reader–writer locks are used ?

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 1 view

0 votes

0 answers

9

Galvin Edition 9 Exercise 7 Question 11 (Page No. 341-342)
Consider the traffic deadlock depicted in Figure 7.10. a. Show that the four necessary conditions for deadlock hold in this example. b. State a simple rule for avoiding deadlocks in this system

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 1 view

0 votes

0 answers

10

Galvin Edition 9 Exercise 7 Question 10 (Page No. 341)
Is it possible to have a deadlock involving only one single-threaded process ? Explain your answer

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 3 views

0 votes

0 answers

11

Galvin Edition 9 Exercise 7 Question 9 (Page No. 341)
Suppose that you have coded the deadlock-avoidance safety algorithm and now have been asked to implement the deadlock-detection algorithm. Can you do so by simply using the safety algorithm code and redefining $Max_i$ ... $Allocation_i$ specifies the resources currently allocated to process $P_i$ ? Explain your answer.

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 1 view

0 votes

0 answers

12

Galvin Edition 9 Exercise 7 Question 8 (Page No. 341)
Consider the following resource-allocation policy. Requests for and releases of resources are allowed at any time. If a request for resources cannot be satisfied because the resources are not available, then we check any processes ... no, specify which necessary condition cannot occur. b. Can indefinite blocking occur ? Explain your answer.

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 1 view

0 votes

0 answers

13

Galvin Edition 9 Exercise 7 Question 7 (Page No. 341)
Can a system detect that some of its processes are starving? If you answer “yes,” explain how it can. If you answer “no,” explain how the system can deal with the starvation problem.

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 4 views

0 votes

0 answers

14

Galvin Edition 9 Exercise 7 Question 6 (Page No. 340)
Consider a computer system that runs 5,000 jobs per month and has no deadlock-prevention or deadlock-avoidance scheme. Deadlocks occur about twice per month, and the operator must terminate and re run about ten ... for installing the deadlock-avoidance algorithm ? b. What are the arguments against installing the deadlock-avoidance algorithm?

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 1 view

0 votes

0 answers

15

BARC interview
Hello all, Someone please share your experience in BARC interview?? What sort of level of difficulty of questions are asked ??

asked 10 hours ago in Job Queries by s_dr_13 (93 points) | 1 view

0 votes

0 answers

16

Galvin Edition 9 Exercise 7 Question 5 (Page No. 340)
Prove that the safety algorithm requires an order of $m$ $×$ $n^2$ operations where $n$ is the number of processes in the system and $m$ is the number of resource types.

asked 10 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 1 view

0 votes

0 answers

17

Galvin Edition 9 Exercise 7 Question 3 (Page No. 340)
Consider the following snapshot of a system: $Allocation$ $Max$ $Available$ $A$ $B$ $C$ $D$ $A$ $B$ $C$ $D$ $A$ $B$ $C$ $D$ $P_0$ $0$ $0$ $1$ $2$ $0$ $0$ $1$ $2$ $1$ $5$ $2$ $0$ $P_1$ $1$ $0$ $0$ ... $Need$ ? b. Is the system in a safe state ? c. If a request from process $P_1$ arrives for $(0,4,2,0)$, can the request be granted immediately ?

asked 11 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 2 views

0 votes

0 answers

18

Galvin Edition 9 Exercise 7 Question 2 (Page No. 339)
Suppose that a system is in an unsafe state. Show that it is possible for the processes to complete their execution without entering a deadlocked state.

asked 11 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 2 views

0 votes

0 answers

19

Galvin Edition 9 Exercise 7 Question 1 (Page No. 339)
List three examples of deadlocks that are not related to a computer system environment.

asked 11 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 2 views

0 votes

0 answers

20

Galvin Edition 9 Exercise 6 Question 32 (Page No. 311)
Explain why interrupt and dispatch latency times must be bounded in a hard real-time system ?

asked 14 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 5 views

0 votes

0 answers

21

Galvin Edition 9 Exercise 6 Question 30 (Page No. 311)
Under what circumstances is $rate$-$monotonic$ $scheduling$ inferior to $earliest$-$deadline$-$first$ $scheduling$ in meeting the deadlines associated with processes ?

asked 15 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 1 view

0 votes

0 answers

22

Galvin Edition 9 Exercise 6 Question 29 (Page No. 311)
Discuss ways in which the priority inversion problem could be addressed in a real-time system. Also discuss whether the solutions could be implemented within the context of a proportional share scheduler

asked 15 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 1 view

0 votes

0 answers

23

Galvin Edition 9 Exercise 6 Question 28 (Page No. 311)
Assume that two tasks A and B are running on a $Linux$ $system$. The nice values of A and B are $−5$ and $+5$, respectively. Using the $CFS$ scheduler as a guide, describe how the respective values of $vruntime$ vary between the two processes given each of ... A is $I/O-bound$, and B is $CPU-bound$. A is $CPU-bound$, and B is $I/O-bound$.

asked 15 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 3 views

0 votes

0 answers

24

Galvin Edition 9 Exercise 6 Question 27 (Page No. 310)
Consider the scheduling algorithm in the Solaris operating system for time-sharing threads. a. What is the time quantum $(in milliseconds)$ for a thread with priority 15? With priority 40? b. Assume that a thread with priority 50 ... 20 blocks for $I/O$ before its time quantum has expired. What new priority will the scheduler assign this thread

asked 15 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 1 view

0 votes

0 answers

25

Galvin Edition 9 Exercise 6 Question 26 (Page No. 310)
Assuming that no threads belong to the $REALTIME$_$PRIORITY$_$CLASS$ and that none may be assigned a $TIME$_$CRITICAL$ priority, what combination of priority class and priority corresponds to the highest possible relative priority in Windows scheduling?

asked 15 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 2 views

0 votes

0 answers

26

Galvin Edition 9 Exercise 6 Question 25 (Page No. 310)
Using the Windows scheduling algorithm, determine the numeric priority of each of the following threads. a. A thread in the $REALTIME$_$PRIORITY$_$CLASS$ with a relative priority of $NORMAL$ b. A thread in the $ABOVE$_$NORMAL$_$PRIORITY$ ... $BELOW$_$NORMAL$_$PRIORITY$_$CLASS$ with a relative priority of $ABOVE$_$NORMAL$

asked 15 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 2 views

0 votes

0 answers

27

Galvin Edition 9 Exercise 6 Question 24 (Page No. 310)
Explain the differences in how much the following scheduling algorithms discriminate in favor of short processes: $a. FCFS$ $b. RR$ $c. Multilevel feedback queues$

asked 15 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 3 views

0 votes

0 answers

28

Galvin Edition 9 Exercise 6 Question 23 (Page No. 310)
Consider a preemptive priority scheduling algorithm based on dynamically changing priorities. Larger priority numbers imply higher priority. When a process is waiting for the $CPU$ (in the ready queue, but not running), its priority changes at a rate $\beta$. ... ? b. What is the algorithm that results from $\alpha$ $<$ $\beta$ $<$ $0$ ?

asked 15 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 1 view

0 votes

0 answers

29

Galvin Edition 9 Exercise 6 Question 22 (Page No. 310)
Consider a system implementing multilevel queue scheduling. What strategy can a computer user employ to maximize the amount of $CPU$ time allocated to the user’s process ?

asked 15 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 2 views

0 votes

0 answers

30

Galvin Edition 9 Exercise 6 Question 21 (Page No. 309-310)
Consider a system running ten $I/O-bound$ tasks and one $CPU-bound$ task. Assume that the $I/O-bound$ tasks issue an $I/O$ operation once for every millisecond of CPU computing and that each $I/O$ operation takes ... utilization for a round-robin scheduler when: a. The time quantum is 1 millisecond b. The time quantum is 10 milliseconds

asked 15 hours ago in Operating System by akash.dinkar12 Boss (36k points) | 5 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions without answers

Recent Posts

Recent Blog Comments