Edward Lycklama  Home/Search
Context Related
| toronto.edu/~vassos/resea...paper.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: toronto.edu/~va...ofpublications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an algorithm for the mutual exclusion problem that satisfies the "first come first served" property and requires only five shared bits per participant. The algorithm works in a model of concurrency that does not assume atomic operations. August 26, 1991 i 1. Introduction Mutual exclusion is a basic and classic synchronisation problem. Informally it can be formulated as follows. We have a collection of N processes each having the structure illustrated in Figure 1.1. repeat NCS... (Update)
Context of citations to this paper: More
.... three algorithms are Lamport s algorithm without time bound requirement [6] a FIFO based algorithm proposed by Lycklama and Hadzilacos [7], simplified as LH algorithm, and a tree structured algorithm proposed by Yang and Anderson, simplified as YA algorithm [10] Each...
.... One important exception is the seminal work [19] Another self stabilizing solution to the mutual exclusion problem is mentioned in [21] and appears in [27] In Dijkstra s self stabilizing mutual exclusion protocol [6] the state variables are shared, and communication is...
Cited by: More
Dijkstra's Self-Stabilizing Algorithm in Unsupportive.. - Dolev, Herman (Correct)
Bakery Algorithms - Abraham (2001) (Correct)
Self-Stabilizing l-Exclusion - Abraham, Dolev, Herman, Koll (2001) (Correct)
Active bibliography (related documents): More All
0.5: Mutual Exclusion Using Invisible Reads and Writes - Burns, al. (1980) (Correct)
0.3: Distributed FIFO Allocation of Identical Resources.. - Fischer, Lynch.. (1989) (Correct)
0.2: Atomic Semantics of Nonatomic Programs - Anderson, Gouda (1987) (Correct)
Similar documents based on text: More All
0.2: An Efficient Group Communication Architecture over ATM Networks - Park, Lee (Correct)
0.1: A Multithreaded Message-Passing System for High Performance.. - Park, Lee (1998) (Correct)
0.1: NYNET Communication System (NCS) : A Multithreaded Message Passing .. - Park (1996) (Correct)
Related documents from co-citation: More All
5: Bounded Time-Stamps (context) - Israeli, Li - 1987
4: A new solution of Dijkstra's concurrent programming problem (context) - Lamport - 1974
4: Myths About the Mutual Exclusion Problem (context) - Peterson - 1981
BibTeX entry: (Update)
E. A. Lycklama and V. Hadzilacos, "A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables," ACM Transactions on Programming Languages and Systems, Vol. 13, No. 4, 1991, pp. 558-576. http://citeseer.ist.psu.edu/lycklama91first.html More
@article{ lycklama91firstcomefirstserved,
author = "Edward A. Lycklama and Vassos Hadzilacos",
title = "A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables",
journal = "ACM Transactions on Programming Languages and Systems",
volume = "13",
number = "4",
month = "October",
publisher = "ACM Press",
pages = "558--576",
year = "1991",
url = "citeseer.ist.psu.edu/lycklama91first.html" }
Citations (may not include all citations):340 Self-stabilizing systems in spite of distributed control (context) - Dijkstra - 1974
142 Solution of a problem in concurrent programming control (context) - Dijkstra - 1965
26 On inter-process communication --- Parts I and II (context) - Lamport - 1986
21 Additional comments on a problem in concurrent programming c.. (context) - Knuth - 1966
18 Mutual exclusion using indivisible reads and writes - Burns, Lynch - 1980
13 Further comments on Dijkstra's concurrent programming contro.. (context) - Eisenberg, McGuire - 1972
12 A new solution to Lamport's concurrent programming problem u.. (context) - Peterson - 1983
8 A new solution to Dijkstra's concurrent programming problem (context) - Lamport - 1974
7 A new solution to the critical section problem (context) - Katseff - 1978
5 Additional comments on a problem in concurrent programming c.. (context) - deBruijn - 1967
4 Complexity of communication among asynchronous parallel proc.. (context) - Burns - 1981
4 The mutual exclusion problem --- Parts I and II (context) - Lamport - 1986
1 A first-come first-served solution to the critical section p.. (context) - Lycklama - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.toronto.edu/~vassos/research/list-of-publications.html): More
The Weakest Failure Detector for Solving Consensus - Chandra, Hadzilacos, Toueg (1996) (Correct)
On the Robustness of the Hrm Hierarchy - Chandra, Hadzilacos, Jayanti, Toueg (1998) (Correct)
Transaction Synchronisation In Object Bases - Hadzilacos, Hadzilacos (1988) (Correct)
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