Achour Mostefaoui, et al.  Home/Search
Context Related
| irisa.fr/techreports/20...PI1393.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: irisa.fr/bibli/publi/pi/20...1393 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we present condition based solutions to k-set agreement problems. A condition C is a set of input vectors to the problem. We identify a class of conditions that allow to solve k-set agreement in spite of f crashes in an asynchronous system. Moreover, we design a protocol that is always safe: it is guaranteed to terminate when the input vector belongs to C or there are less than k crashes, but it always decides on at most k different values, even if the input vector does not... (Update)
Cited by: More
Efficient Condition-Based Consensus - Achour Most Efaoui (2001) (Correct)
Distributed Computing manuscript No. - Will Be Inserted (Correct)
Digital Object Identifier (DOI) 10.1007/s00446-003-0093-9 - Distrib Comput.. (Correct)
Active bibliography (related documents): More All
0.5: A Necessary and Sufficient Condition for.. - Anceaume.. (Correct)
0.5: A Hierarchy of Conditions for Consensus Solvability - Exte Nd Ed (Correct)
0.3: Boosting Fault-Tolerance in Asynchronous Message Passing.. - Attie, Lynch, Rajsbaum (2002) (Correct)
Similar documents based on text: More All
1.0: The Lord Of The Rings, Efficient Of Views At Dataware.. - Mostéfaoui, Raynal.. (2002) (Correct)
0.7: Communication-Based Prevention Of Useless.. -.. (1997) (Correct)
0.7: A practical Building block for solving . . . - Hurfin, al. (Correct)
Related documents from co-citation: More All
5: Atomic snapshots of shared memory - Afek, Attiya et al. - 1993
5: Unreliable failure detectors for reliable distributed systems - Chandra, Toueg - 1996
5: Conditions on Input Vectors for Consensus Solvability in Asynchronous Distribute.. (context) - Mostefaoui, Rajsbaum et al. - 2001
BibTeX entry: (Update)
A. Most'efaoui, S. Rajsbaum, M. Raynal, and M. Roy. Condition-based protocols for set agreement problems. In Proceedings of the thirty-third Annual ACM symposium on Distributed Computing, Lecture Notes in Computer Science, pages 48--62. Springer, 2002. http://citeseer.ist.psu.edu/mostefaoui02conditionbased.html More
@misc{ most'efaoui02conditionbased,
author = "A. Most'efaoui and S. Rajsbaum and M. Raynal and M. Roy",
title = "Condition-based protocols for set agreement problems",
text = "A. Most'efaoui, S. Rajsbaum, M. Raynal, and M. Roy. Condition-based protocols
for set agreement problems. In Proceedings of the thirty-third Annual ACM
symposium on Distributed Computing, Lecture Notes in Computer Science, pages
48--62. Springer, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/mostefaoui02conditionbased.html" }
Citations (may not include all citations):739 Impossibility of Distributed Consensus with One Faulty Proce.. (context) - Fischer, Lynch et al. - 1985
718 Distributed Algorithms (context) - Lynch - 1996
414 Unreliable Failure Detectors for Reliable Distributed System.. - Chandra, Toueg - 1996
326 Linearizability: a Correctness Condition for Concurrent Obje.. (context) - Herlihy, Wing - 1990
214 Consensus in the Presence of Partial Synchrony - Dwork, Lynch et al. - 1988
178 Elements Of Algebraic Topology (context) - Munkres - 1984
153 the Minimal Synchronism Needed for Distributed Consensus (context) - Dolev, Dwork et al. - 1987
99 Atomic Snapshots of Shared Memory - Afek, Attiya et al. - 1993
95 The Asynchronous Computability Theorem for t-Resilient Tasks - Herlihy, Shavit - 1993
87 Group Communication Specifications: A Comprehensive Study - Chockler, Keidar et al.
82 Generalized FLP Impossibility Results for t-Resilient Asynch.. (context) - Borowsky, Gafni - 1993
77 Reaching Approximate Agreement in the Presence of Faults - Dolev, Lynch et al. - 1986
56 Distributed Computing: Fundamentals (context) - Attiya, Welch - 1998
56 Another Advantage of Free Choice: Completely Asynchronous Ag.. (context) - Ben-Or - 1983
55 Set Agreement is Impossible: the Topology of Public Knowledg.. (context) - Saks, Zaharoglou - 1993
39 More Choices Allow More Faults: Set Consensus Problems in To.. - Chaudhuri - 1993
36 A Combinatorial Characterization of the Distributed 1-Solvab.. (context) - Biran, Moran et al. - 1990
20 Conditions on Input Vectors for Consensus Solvability in Asy.. (context) - Most'efaoui, Rajsbaum et al. - 2001
17 The BG Distributed Simulation Algorithm - Borowsky, Gafni et al. - 2001
15 SIAM Journal on Computing (context) - Attiya, Rachman et al. - 1998
10 Failure Detection and Randomization: a Hybrid Approach to So.. - Aguilera, Toueg - 1998
9 The Best of Both Worlds: a Hybrid Approach to Solve Consensu.. (context) - Mostefaoui, Raynal et al. - 2000
5 th ACM Symposium on Principles of Distributed Computing (context) - Most'efaoui, Rajsbaum et al. - 2001
3 Mathematical Structures in Computer Science (context) - Herlihy, Rajsbaum - 2000
2 Set Agreement with Limited Accuracy Failure Detectors (context) - Mostefaoui, Raynal - 2000
1 Synchronous Round Operators (context) - Herlihy, Rajsbaum et al. - 2000
1 th th ACM Symposium on Parallel Algorithms and Architectures (context) - Mostefaoui, Raynal - 2001
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