𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


A Quorum-Based Self-Stabilizing Distribu
✍ Mikhail Nesterenko; Masaaki Mizuno πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 187 KB

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

A Log (N) Distributed Mutual Exclusion A
✍ Mohamed Naimi; Michel Trehel; AndrΓ© Arnold πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 378 KB

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

Optimal design of k-space trajectories u
✍ Brian M. Dale; Jonathan S. Lewin; Jeffrey L. Duerk πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 435 KB πŸ‘ 1 views

## 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