Achour Mostefaoui
Sergio Rajsbaum
ABSTRACT
No abstract available.
- Mostefaoui A., Rajsbaum S. and Raynal M., Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems. JACM, 50(6):922--954, 2003. Google Scholar
Digital Library
- Mostefaoui A., Rajsbaum S. and Raynal M., Using Conditions to Expedite Consensus in Synchronous Systems. Proc. 17th Int. Symposium on Distributed Computing (DISC 2003), Springer-Verlag LNCS #2848, pp. 249--263, 2003.Google ScholarCross Ref
- Mostefaoui A., Rajsbaum S. and Raynal M., The Synchronous Condition-based Hierarchy. Tech Report, #1584, 26 pages, Irisa, Univ. de Rennes 1 (France), 2003.Google Scholar
- Mostefaoui A., Rajsbaum S., Raynal M. and Roy M., Condition-Based Consensus Solvability: a Hierarchy of Conditions and Efficient Protocols. Distributed Computing, 17:1--20, 2004. Google ScholarDigital Library
- Zibin Y., Condition-Based Consensus in Synchronous Systems. Proc. 17th Int. Symposium on Distributed Computing (DISC 2003), Springer-Verlag LNCS #2848, pp. 239--248, 2003.Google ScholarCross Ref
Index Terms
- Brief announcement: the synchronous condition-based consensus hierarchy
Recommendations
Brief Announcement: Computing in the Presence of Weak Crash Failures
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingWe consider an asynchronous shared memory system of n processes where processes may experience weak crash failures. A crash m-failure is a crash failure of a process that may occurs only while the point contention is at most m. It is known that there is ...
Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures
AbstractUniform Atomic Broadcast is one of the most important fault-tolerant communication abstractions for distributed systems. It ensures that processes deliver messages in the same order, even when processes may fail by crashing. On the other hand, ...
Brief announcement: byzantine agreement with homonyms
SPAA '10: Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architecturesIn this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total number of processes n, in the presence of t < n Byzantine processes.
We ...
Comments