Solutions to the critical section problem exhibit three properties: mutual exclusion, progress, and bounded waiting. When do we say, or do we at least say, that operating system-implemented semaphores and monitors possess all these three properties?

An example would be bounded waiting on semaphores. In bounded semaphores there's a limit on the queue. When the queue is full, is it still safe to say that there is bounded waiting?

  • $\begingroup$ Only one question at a time, please! Your first question is, I think, answered at this link: cs.stackexchange.com/q/30247/7459. Your last question, "is it true that monitors are usable for lightweight processes only?" The answer is "no". The middle question about bounded waiting could be interesting, but needs to be re-written, I think. $\endgroup$ – Wandering Logic Sep 30 '14 at 12:08
  • $\begingroup$ @WanderingLogic Thanks, I modified the question to make it clearer. $\endgroup$ – damat-perdigannat Sep 30 '14 at 14:34

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.