Register

Recent questions tagged descriptive

0 votes
0 answers
1683
Galvin Edition 9 Exercise 6 Question 10 (Page No. 307)
Why is it important for the scheduler to distinguish $I/O-bound$ programs from $CPU-bound$ programs?
Why is it important for the scheduler to distinguish $I/O-bound$ programs from $CPU-bound$ programs?
User Avatar
0 votes
0 answers
1686
Galvin Edition 9 Exercise 6 Question 7 (Page No. 307)
Distinguish between $PCS$(Process Contention Scope) and $SCS$(Source Contention Scope) scheduling.
Distinguish between $PCS$(Process Contention Scope) and $SCS$(Source Contention Scope) scheduling.
User Avatar
0 votes
0 answers
1689
Galvin Edition 9 Exercise 6 Question 4 (Page No. 306)
What advantage is there in having different time-quantum sizes at different levels of a multilevel queueing system ?
What advantage is there in having different time-quantum sizes at different levels of a multilevel queueing system ?
User Avatar
0 votes
0 answers
1698
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
1699
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
1700
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
1701
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
1702
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
1705
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
1710
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
Page: