A distributed k-mutual exclusion algorithm using k-coterie
β Scribed by Hirotsugu Kakugawa; Satoshi Fujita; Masafumi Yamashita; Tadashi Ae
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 580 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we present a self-stabilizing quorum-based distributed mutual exclusion algorithm. Our algorithm is designed for an asynchronous message-passing model. The algorithm scales well since it has constant synchronization delay and its message complexity is proportional to the square root o
Several algorithms reducing the number of messages were presented later (see Ricart and Agrawala [21] and Carvalho and Roucairol [4]). The number of messages was proportional to N. The algorithm presented by Chandy and Misra [6] (in which permission is in the form of a fork) is the most efficient of
## Abstract Spiral, radial, and other nonrectilinear __kβ__space trajectories are an area of active research in MRI due largely to their typically rapid acquisition times and benign artifact patterns. Trajectory design has commonly proceeded from a description of a simple shape to an investigation