Register

Recent questions tagged process-synchronization

0 votes
0 answers
125
Galvin Edition 9 Exercise 5 Question 29 (Page No. 248)
How does the $signal()$ operation associated with monitors differ from the corresponding operation defined for semaphores?
How does the $signal()$ operation associated with monitors differ from the corresponding operation defined for semaphores?
User Avatar
0 votes
0 answers
126
Galvin Edition 9 Exercise 5 Question 28 (Page No. 247)
Discuss the tradeoff between fairness and throughput of operations in the readers–writers problem. Propose a method for solving the readers–writers problem without causing starvation.
Discuss the tradeoff between fairness and throughput of operations in the readers–writers problem. Propose a method for solving the readers–writers problem without ca...
User Avatar
0 votes
0 answers
127
Galvin Edition 9 Exercise 5 Question 26 (Page No. 247)
Design an algorithm for a bounded-buffer monitor in which the buffers (portions) are embedded within the monitor itself.
Design an algorithm for a bounded-buffer monitor in which the buffers (portions) are embedded within the monitor itself.
User Avatar
0 votes
0 answers
128
Galvin Edition 9 Exercise 5 Question 25 (Page No. 247)
Demonstrate that monitors and semaphores are equivalent in so far as they can be used to implement solutions to the same types of synchronization problems.
Demonstrate that monitors and semaphores are equivalent in so far as they can be used to implement solutions to the same types of synchronization problems.
User Avatar
0 votes
0 answers
129
Galvin Edition 9 Exercise 5 Question 23 (Page No. 247)
Show how to implement the $wait()$ and $signal()$ semaphore operations in multiprocessor environments using the $test and set() $instruction. The solution should exhibit minimal busy waiting.
Show how to implement the $wait()$ and $signal()$ semaphore operations in multiprocessor environments using the $test and set() $instruction. The solution should exhibit ...
User Avatar
0 votes
0 answers
132
Galvin Edition 9 Exercise 5 Question 20 (Page No. 246-247)
Consider the code example for allocating and releasing processes shown below: ... of processes = 0 with the atomic integer atomic t number of processes = 0 to prevent the race condition(s)?
Consider the code example for allocating and releasing processes shown below:$#define MAX PROCESSES 255int number of processes = 0;/* the implementation of fork() calls t...
User Avatar
0 votes
0 answers
137
Galvin Edition 9 Exercise 5 Question 14 (Page No. 244)
Describe how the compare_and_swap() instruction can be used to provide mutual exclusion that satisfies the bounded-waiting requirement.
Describe how the compare_and_swap() instruction can be used to provide mutual exclusion that satisfies the bounded-waiting requirement.
User Avatar
0 votes
0 answers
138
Galvin Edition 9 Exercise 5 Question 13 (Page No. 244)
Describe two kernel data structures in which race conditions are possible.Be sure to include a description of how a race condition can occur.
Describe two kernel data structures in which race conditions are possible.Be sure to include a description of how a race condition can occur.
User Avatar
0 votes
0 answers
139
Galvin Edition 9 Exercise 5 Question 12 (Page No. 244)
The Linux kernel has a policy that a process cannot hold a spin lock while attempting to acquire a semaphore. Explain why this policy is in place.
The Linux kernel has a policy that a process cannot hold a spin lock while attempting to acquire a semaphore. Explain why this policy is in place.
User Avatar
0 votes
0 answers
140
Galvin Edition 9 Exercise 5 Question 11 (Page No. 244)
Explain why interrupts are not appropriate for implementing synchronization primitives in multiprocessor systems.
Explain why interrupts are not appropriate for implementing synchronization primitives in multiprocessor systems.
User Avatar
0 votes
0 answers
141
Galvin Edition 9 Exercise 5 Question 10 (Page No. 243)
Explain why implementing synchronization primitives by disabling interrupts is not appropriate in a single-processor system if the synchronization primitives are to be used in user-level programs.
Explain why implementing synchronization primitives by disabling interrupts is not appropriate in a single-processor system if the synchronization primitives are to be us...
User Avatar
0 votes
0 answers
146
Galvin Edition 9 Exercise 5 Question 5 (Page No. 243)
Show that, if the $wait()$ and $signal()$ semaphore operations are not executed atomically, then mutual exclusion may be violated.
Show that, if the $wait()$ and $signal()$ semaphore operations are not executed atomically, then mutual exclusion may be violated.
User Avatar
0 votes
0 answers
147
Galvin Edition 9 Exercise 5 Question 4 (Page No. 243)
Explain why spin locks are not appropriate for single-processor systems yet are often used in multiprocessor systems.
Explain why spin locks are not appropriate for single-processor systems yet are often used in multiprocessor systems.
User Avatar
0 votes
0 answers
148
Galvin Edition 9 Exercise 5 Question 3 (Page No. 243)
What is the meaning of the term busy waiting ? What other kinds of waiting are there in an operating system ? Can busy waiting be avoided altogether ? Explain your answer.
What is the meaning of the term busy waiting ? What other kinds of waiting are there in an operating system ? Can busy waiting be avoided altogether ? Explain your answer...
User Avatar
0 votes
0 answers
150
Galvin Edition 9 Exercise 5 Question 1 (Page No. 242)
disabling interrupts frequently can affect the system’s clock. Explain why this can occur and how such effects can be minimized.
disabling interrupts frequently can affect the system’s clock. Explain why this can occur and how such effects can be minimized.
User Avatar
Page: