C. M. Fleiner and M. Philippsen. Fair Multi-Branch Locking of Several Locks. In International Conference on Parallel and Distributed Computing and Systems, pages 537--545, Washington D.C., October 1997. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
The Universe Model: An Approach for Improving the.. - Behrends, Stirewalt (2000) (Correct)
....is not a correctness condition that can be be expressed in terms of universe constraints. If the scheduler were to not consider the possibility, a correct program could still exhibit starvation problems. As a result, the scheduler needs to implement an algorithm such as the one described in [7] to handle the acquisition of multiple locks fairly. 4. CONCURRENCYAND COMPOSABILITY The universe model enriches module interfaces with constraints that relate the availability of a service to the status of the object that provides the service. At run time, a realm will only contain universes ....
C. M. Fleiner and M. Philippsen. Fair Multi-Branch Locking of Several Locks. In International Conference on Parallel and Distributed Computing and Systems, pages 537--545, Washington D.C., October 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC