
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Achour Mostefaoui, Michel Raynal, Corentin Travers, "TimeFree and TimerBased Assumptions Can Be Combined to Obtain Eventual Leadership," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 7, pp. 656666, July, 2006.  
BibTex  x  
@article{ 10.1109/TPDS.2006.95, author = {Achour Mostefaoui and Michel Raynal and Corentin Travers}, title = {TimeFree and TimerBased Assumptions Can Be Combined to Obtain Eventual Leadership}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {17}, number = {7}, issn = {10459219}, year = {2006}, pages = {656666}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.95}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  TimeFree and TimerBased Assumptions Can Be Combined to Obtain Eventual Leadership IS  7 SN  10459219 SP656 EP666 EPD  656666 A1  Achour Mostefaoui, A1  Michel Raynal, A1  Corentin Travers, PY  2006 KW  Asynchronous system KW  distributed algorithm KW  fault tolerance KW  hybrid protocol KW  leader election KW  process crash KW  timefree assumption KW  timerbased assumption. VL  17 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Leaderbased protocols rest on a primitive able to provide the processes with the same unique leader. Such protocols are very common in distributed computing to solve synchronization or coordination problems. Unfortunately, providing such a primitive is far from being trivial in asynchronous distributed systems prone to process crashes. (It is even impossible in faultprone purely asynchronous systems.) To circumvent this difficulty, several protocols have been proposed that build a leader facility on top of an asynchronous distributed system enriched with additional assumptions. The protocols proposed so far consider either additional assumptions based on synchrony or additional assumptions on the pattern of the messages that are exchanged. Considering systems with
[1] M.K. Aguilera, C. DelporteGallet, H. Fauconnier, and S. Toueg, “On Implementing Omega with Weak Reliability and Synchrony Assumptions,” Proc. 22nd ACM Symp. Principles of Distributed Computing (PODC '03), pp. 306314, 2003.
[2] M.K. Aguilera, C. DelporteGallet, H. Fauconnier, and S. Toueg, “CommunicationEfficient Leader Election and Consensus with Limited Link Synchrony,” Proc. 23rd ACM Symp. Principles of Distributed Computing (PODC '04), pp. 328337, 2004.
[3] E. Anceaume, A. Fernandez, A. Mostefaoui, G. Neiger, and M. Raynal, “Necessary and Sufficient Condition for Transforming Limited Accuracy Failure Detectors,” J. Computer and System Sciences, vol. 68, pp. 123133, 2004.
[4] T.D. Chandra and S. Toueg, “Unreliable Failure Detectors for Reliable Distributed Systems,” J. ACM, vol. 43, no. 2, pp. 225267, 1996.
[5] T.D. Chandra, V. Hadzilacos, and S. Toueg, “The Weakest Failure Detector for Solving Consensus,” J. ACM, vol. 43, no. 4, pp. 685722, 1996.
[6] F. Chu, “Reducing $\Omega$ to $\diamond {\cal {W}}$ ,” Information Processing Letters, vol. 76, no. 6, pp. 293298, 1998.
[7] F. Cristian and C. Fetzer, “The Timed Asynchronous System Model,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 6, pp. 642657, June 1999.
[8] C. Dwork, N. Lynch, and L. Stockmeyer, “Consensus in the Presence of Partial Synchrony,” J. ACM, vol. 35, no. 2, pp. 288323, 1988.
[9] M.J. Fischer, N. Lynch, and M.S. Paterson, “Impossibility of Distributed Consensus with One Faulty Process,” J. ACM, vol. 32, no. 2, pp. 374382, 1985.
[10] R. Guerraoui, “Indulgent Algorithms,” Proc. 19th ACM Symp. Principles of Distributed Computing, (PODC '00), pp. 289298, 2000.
[11] R. Guerraoui and M. Raynal, “The Information Structure of Indulgent Consensus,” IEEE Trans. Computers, vol. 53, no. 4, pp. 453466, Apr. 2004.
[12] M. Hutle, “Omega in Sparse Networks,” Fast Abstracts, Proc. 10th IEEE Int'l Pacific Rim Dependable Computing Symp. (PRDC '04), 2004.
[13] L. Lamport, “The PartTime Parliament,” ACM Trans. Computer Systems, vol. 16, no. 2, pp. 133169, 1998.
[14] M. Larrea, A. Fernández, and S. Arévalo, “Optimal Implementation of the Weakest Failure Detector for Solving Consensus,” Proc. 19th Symp. Reliable Distributed Systems (SRDS '00), pp. 5260, 2000.
[15] A. Mostefaoui, E. Mourgaya, and M. Raynal, “Asynchronous Implementation of Failure Detectors,” Proc. Int'l IEEE Conf. Dependable Systems and Networks (DSN '03), pp. 351360, 2003.
[16] A. Mostefaoui and M. Raynal, “LowCost ConsensusBased Atomic Broadcast,” Proc. Seventh IEEE Pacific Rim Int'l Symp. Dependable Computing (PRDC '00), pp. 4552, 2000.
[17] A. Mostefaoui and M. Raynal, “LeaderBased Consensus,” Parallel Processing Letters, vol. 11, no. 1, pp. 95107, 2001.
[18] A. Mostefaoui, M. Raynal, and C. Travers, “CrashResilient TimeFree Eventual Leadership,” Proc. 23rd Symp. Reliable Distributed Systems (SRDS '04), pp. 208217, 2004.
[19] F. Pedone and A. Schiper, “Handling Message Semantics with Generic Broadcast Protocols,” Distributed Computing, vol. 15, no. 2, pp. 97107, 2002.
[20] D. Powell, “Failure Mode Assumptions and Assumption Coverage,” Proc. 22nd Int'l Symp. FaultTolerant Computing (FTCS22), pp. 386395, 1992.