Register

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 37 (Page No. 177)

370 views
0 votes
0 votes
Suppose that we have a message-passing system using mailboxes. When sending to a full mailbox or trying to receive from an empty one, a process does not block. Instead, it gets an error code back. The process responds to the error code by just trying again, over and over, until it succeeds. Does this scheme lead to race conditions?
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
admin asked Oct 25, 2019
2,912 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 44 (Page No. 177)
Five jobs are waiting to be run. Their expected run times are $9, 6, 3, 5,$ and $X$. In what order should they be run to minimize average response time? $($Your answer will depend on $X.)$
Five jobs are waiting to be run. Their expected run times are $9, 6, 3, 5,$ and $X$. In what order should they be run to minimize average response time? $($Your answer wi...
User Avatar
0 votes
0 votes
1 answer
4
admin asked Oct 25, 2019
2,268 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 42 (Page No. 177)
Explain how time quantum value and context switching time affect each other, in a round-robin scheduling algorithm.
Explain how time quantum value and context switching time affect each other, in a round-robin scheduling algorithm.
User Avatar
Link Copied!