Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld  Home/Search
Context Related
| math.tau.ac.il/pub/afek...mfaults.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: math.tau.ac.il/~milo/dep...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper investigates the effects of the failure of shared objects on distributed systems. First the notion of a faulty shared object is introduced. Then upper and lower bounds on the space complexity of implementing reliable shared objects are provided. (Update)
Similar documents based on text: More All
0.3: Benign Failure Models for Shared Memory - Afek, Merritt, Taubenfeld (1995) (Correct)
0.3: Objects Shared by Byzantine Processes - Malkhi, Merritt, Reiter, Taubenfeld (Correct)
0.2: Disentangling Multi-object Operations (Extended Abstract) - Afek, Merritt.. (Correct)
BibTeX entry: (Update)
Y. Afek, D.S. Greenberg, M. Merritt and G. Taubenfeld, "Computing with Faulty Shared Objects", Journal of the ACM, Vol. 42., No. 6, pp. 1231-1274, 1995. http://citeseer.ist.psu.edu/afek95computing.html More
@article{ afek95computing,
author = "Yehuda Afek and David S. Greenberg and Michael Merritt and Gadi Taubenfeld",
title = "Computing with faulty shared objects",
journal = "Journal of the ACM",
volume = "42",
number = "6",
pages = "1231--1274",
year = "1995",
url = "citeseer.ist.psu.edu/afek95computing.html" }
Citations (may not include all citations):739 Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
723 Memory coherence in shared virtual memory systems - Li, Hudak - 1989
340 Self-stabilizing systems in spite of distributed control (context) - Dijkstra - 1974
293 Hierarchical correctness proofs for distributed algorithms - Lynch, Tuttle - 1987
232 Linda in context (context) - Carriero, Gelernter - 1989
142 Solution of a problem in concurrent programming control (context) - Dijkstra - 1965
107 A new solution of Dijkstra's concurrent programming problem (context) - Lamport - 1974
99 Atomic snapshots of shared memory - Afek, Attiya et al. - 1993
92 Memory requirements for agreementamong unreliable asynchrono.. (context) - Loui, Abu-Amara - 1987
87 Computing Surveys (context) - Smith - 1982
85 Operating System Concepts (context) - Peterson, Silberschatz - 1985
78 Fast randomized consensus using shared memory - Aspnes, Herlihy - 1990
77 Ultracomputers: A teraflop before its time (context) - Bell - 1992
70 The consensus problem in unreliable distributed systems - Fischer - 1983
55 On achieving consensus using a shared memory (context) - Abrahamson - 1988
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.tau.ac.il/~milo/dept/papers.html): More
The Complexity of Mean Payoff Games on Graphs - Zwick, Paterson (1996) (Correct)
Elimination Trees and the Construction of Pools and Stacks - Shavit, Touitou (1996) (Correct)
Finding the αn-th Largest Element - Dor, Zwick (1994) (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