Wakeup under read/write atomicity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 486 LNCS, Issue , 1991, Pages 277-288

  Jayanti, Prasad ^a   Toueg, Sam ^a  

^a Department of Molecular Biology and Genetics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASYNCHRONOUS SYSTEM; LEADER ELECTION; LOWER AND UPPER BOUNDS; READ/WRITE ATOMICITY; SHARED MEMORY;

MEMORY ARCHITECTURE;

EID: 84958748639     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54099-7_19     Document Type: Conference Paper

References (7)

1. [CIL87] Benny Chor, Amos Israeli, and Ming Li. On processor coordination using asynchronous hardware. In The 16th ACM Symposium on Principles of Distributed Computing, pages 86–97, August 1987.
2. Edsger Dijkstra. Self-stabilizing systems in spite of distributed control. CACM, 17:643–644, 1974.
3. [FLP85] Michael Fischer, Nancy Lynch, and Michael Paterson. Impossibility of distributed consensus with one faulty process. JACM, 32(2):374–382, 1985.
4. [FMRT90] Michael Fischer, Shlomo Moran, Steven Rudich, and Gadi Taubenfeld. The wakeup problem. In Twenty-second Annual Symposium on Theory of Computing, May 1990.
5. Alon Itai. On the computation power needed to elect a leader. In 4th International Workshop on Distributed Algorithms, September 1990.
6. Prasad Jayanti and Sam Toueg. Optimal wakeup and related problems. Technical report, Cornell University, Dept. of Computer Science, Cornell University, Ithaca, NY, 1990. In preparation.
7. Leslie Lamport. On interprocess communication, parts i and ii. Distributed Computing, 1:77–101, 1986.