Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged galvin
0
votes
0
answers
121
Galvin Edition 9 Exercise 8 Question 9 (Page No. 391)
Explain the difference between internal and external fragmentation.
Explain the difference between internal and external fragmentation.
akash.dinkar12
144
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
descriptive
+
–
0
votes
0
answers
122
Galvin Edition 9 Exercise 8 Question 8 (Page No. 390-391)
In the IBM/370, memory protection is provided through the use of keys. A key is a 4-bit quantity. Each 2-K block of memory has a key (the storage key) associated with it. The CPU also has a key (the ... Multiprogramming with a fixed number of processes $d$. Multiprogramming with a variable number of processes $e$. Paging $f$.Segmentation
In the IBM/370, memory protection is provided through the use of keys. A key is a 4-bit quantity. Each 2-K block of memory has a key (the storage key) associated with it....
akash.dinkar12
309
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
descriptive
+
–
0
votes
0
answers
123
Galvin Edition 9 Exercise 8 Question 7 (Page No. 390)
Sharing segments among processes without requiring that they have the same segment number is possible in a dynamically linked segmentation system. a. Define a system that allows static linking and sharing of segments without requiring that ... a paging scheme that allows pages to be shared without requiring that the page numbers be the same.
Sharing segments among processes without requiring that they have the same segment number is possible in a dynamically linked segmentation system.a. Define a system that ...
akash.dinkar12
495
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
descriptive
+
–
0
votes
0
answers
124
Galvin Edition 9 Exercise 8 Question 6 (Page No. 390)
Describe a mechanism by which one segment could belong to the address space of two different processes.
Describe a mechanism by which one segment could belong to the address space of two different processes.
akash.dinkar12
346
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
descriptive
+
–
1
votes
0
answers
125
Galvin Edition 9 Exercise 8 Question 5 (Page No. 390)
What is the effect of allowing two entries in a page table to point to the same page frame in memory? Explain how this effect could be used to decrease the amount of time needed to copy a large amount of memory from one place to another. What effect would updating some byte on the one page have on the other page ?
What is the effect of allowing two entries in a page table to point to the same page frame in memory? Explain how this effect could be used to decrease the amount of time...
akash.dinkar12
326
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
descriptive
+
–
1
votes
1
answer
126
Galvin Edition 9 Exercise 8 Question 4 (Page No. 390)
Consider a logical address space of $64$ pages of $1,024$ words each, mapped onto a physical memory of $32$ frames. $a$. How many bits are there in the logical address ? $b$. How many bits are there in the physical address ?
Consider a logical address space of $64$ pages of $1,024$ words each, mapped onto a physical memory of $32$ frames.$a$. How many bits are there in the logical address ?$b...
akash.dinkar12
312
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
+
–
0
votes
2
answers
127
Galvin Edition 9 Exercise 8 Question 3 (Page No. 390)
Why are page sizes always powers of 2 ?
Why are page sizes always powers of 2 ?
akash.dinkar12
239
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
descriptive
+
–
0
votes
0
answers
128
Galvin Edition 9 Exercise 8 Question 2 (Page No. 390)
Consider a system in which a program can be separated into two parts: code and data. The $CPU$ knows whether it wants an instruction (instruction fetch) or data (data fetch or store). Therefore, two base-limit ... automatically read-only, so programs can be shared among different users. Discuss the advantages and disadvantages of this scheme.
Consider a system in which a program can be separated into two parts: code and data. The $CPU$ knows whether it wants an instruction (instruction fetch) or data (data fet...
akash.dinkar12
211
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
descriptive
+
–
0
votes
0
answers
129
Galvin Edition 9 Exercise 8 Question 1 (Page No. 390)
Name two differences between logical and physical addresses.
Name two differences between logical and physical addresses.
akash.dinkar12
154
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
memory-management
descriptive
+
–
0
votes
0
answers
130
Galvin Edition 9 Exercise 7 Question 26 (Page No. 344)
Modify your solution to previous question so that it is starvation-free.
Modify your solution to previous question so that it is starvation-free.
akash.dinkar12
194
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
1
votes
0
answers
131
Galvin Edition 9 Exercise 7 Question 25 (Page No. 344)
A single-lane bridge connects the two Vermont villages of North Tunbridge and South Tunbridge. Farmers in the two villages use this bridge to deliver their produce to the neighboring town. The bridge can become deadlocked ... starvation (the situation in which northbound farmers prevent southbound farmers from using the bridge, or vice versa).
A single-lane bridge connects the two Vermont villages of North Tunbridge and South Tunbridge. Farmers in the two villages use this bridge to deliver their produce to the...
akash.dinkar12
479
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
0
votes
0
answers
132
Galvin Edition 9 Exercise 7 Question 24 (Page No. 344)
What is the optimistic assumption made in the deadlock-detection algorithm ? How can this assumption be violated ?
What is the optimistic assumption made in the deadlock-detection algorithm ? How can this assumption be violated ?
akash.dinkar12
446
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
1
votes
1
answer
133
Galvin Edition 9 Exercise 7 Question 23 (Page No. 344)
Consider the following snapshot of a system: $Allocation$ $Max$ $Available$ $A$ $B$ $C$ $D$ $A$ $B$ $C$ $D$ $A$ $B$ $C$ $D$ $P_0$ $2$ $0$ $0$ $1$ $4$ $2$ $1$ $2$ $3$ $3$ $2$ $1$ $P_1$ $3$ $1$ ... $c$. If a request from process $P_4$ arrives for $(0, 0, 2, 0)$, can the request be granted immediately?
Consider the following snapshot of a system: $Allocation$ $Max$ ...
akash.dinkar12
2.4k
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
134
Galvin Edition 9 Exercise 7 Question 22 (Page No. 343)
Consider the following snapshot of a system: $Allocation$ $Max$ $A$ $B$ $C$ $D$ $A$ $B$ $C$ $D$ $P_0$ $3$ $0$ $1$ $4$ $5$ $1$ $1$ $7$ $P_1$ $2$ $2$ $1$ $0$ $3$ $2$ $1$ $1$ $P_2$ $3$ $1$ $2$ $1$ $3$ ... processes may complete.Otherwise, illustrate why the state is unsafe. $a$. $Available$ $=$ $(0, 3, 0, 1)$ $b$. $Available$ $=$ $(1, 0, 0, 2)$
Consider the following snapshot of a system: $Allocation$ $Max$ $A$ $B...
akash.dinkar12
5.3k
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
135
Galvin Edition 9 Exercise 7 Question 21 (Page No. 343)
We can obtain the banker’s algorithm for a single resource type from the general banker’s algorithm simply by reducing the dimensionality of the various arrays by 1. Show through an example that we cannot implement the multiple-resource-type banker’s scheme by applying the single-resource-type scheme to each resource type individually.
We can obtain the banker’s algorithm for a single resource type from the general banker’s algorithm simply by reducing the dimensionality of the various arrays by 1. ...
akash.dinkar12
501
views
akash.dinkar12
asked
Mar 21, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
136
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.
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....
akash.dinkar12
487
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
137
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.
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. As...
akash.dinkar12
448
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
138
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$.
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 sy...
akash.dinkar12
293
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
2
answers
139
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.
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 dea...
akash.dinkar12
4.3k
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
1
votes
0
answers
140
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.
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 re...
akash.dinkar12
2.8k
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
141
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
Compare the circular-wait scheme with the various deadlock-avoidance schemes (like the banker’s algorithm) with respect to the following issues:a. Runtime overheadsb. S...
akash.dinkar12
600
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
142
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.
$/* thread one runs in this function */void *do work one(void *param){pthread mutex lock(&first mutex);pthread mutex lock(&second mutex);/ * Do some work*/pthread mutex u...
akash.dinkar12
232
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
143
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 ?
Assume a multithreaded application uses only reader–writer locks for synchronization. Applying the four necessary conditions for deadlock, is deadlock still possible if...
akash.dinkar12
387
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
144
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
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 dea...
akash.dinkar12
760
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
145
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
Is it possible to have a deadlock involving only one single-threaded process ? Explain your answer
akash.dinkar12
190
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
146
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.
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 t...
akash.dinkar12
232
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
1
votes
0
answers
147
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.
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 ...
akash.dinkar12
725
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
0
answers
148
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.
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...
akash.dinkar12
356
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
1
votes
0
answers
149
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?
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 oper...
akash.dinkar12
496
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
0
votes
1
answer
150
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.
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....
akash.dinkar12
286
views
akash.dinkar12
asked
Mar 20, 2019
Operating System
galvin
operating-system
deadlock-prevention-avoidance-detection
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register