Relating stabilizing timing assumptions to stabilizing failure detectors regarding solvability and efficiency

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

Volumn 4838 LNCS, Issue , 2007, Pages 4-20

  Biely, Martin ^a   Hutle, Martin ^b   Penso, Lucía Draque ^c   Widder, Josef ^a,d  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b EPFL   (Switzerland)

^c UNIVERSITY OF MANNHEIM   (Germany)

^d ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; STABILIZATION;

COMPUTATIONAL MODELS; FAILURE DETECTORS; MESSAGE DELAYS; STABILIZATION SHIFT;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38349044145     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76627-8_4     Document Type: Conference Paper

References (26)

1. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32, 374-382 (1985)
2. Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. Journal of the ACM 34, 77-97 (1987)
3. Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM 35, 288-323 (1988)
4. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43, 225-267 (1996)
5. Greve, F., Tixeuil, S.: Knowledge connectivity vs. synchrony requirements for faulttolerant agreement in unknown networks. In: DSN 2007. Dependable Systems and Networks, pp. 82-91 (2007)
6. Charron-Bost, B., Guerraoui, R., Schiper, A.: Synchronous system and perfect failure detector: solveability and efficiency issues. In: Proceedings of the International Conference on Dependable System and Networks, IEEE Computer Society Press, Los Alamitos (2000)
7. Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM 43, 685-722 (1996)
8. Keidar, I., Rajsbaum, S.: Open questions on consensus performance in well-behaved runs. In: Schiper, A., Shvartsman, A.A., Weatherspoon, H., Zhao, B.Y. (eds.) Future Directions in Distributed Computing. LNCS, vol. 2584, pp. 35-39. Springer, Heidelberg (2003)
9. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: On implementing Omega with weak reliability and synchrony assumptions. In: Proceeding of the 22nd Annual ACM Symposium on Principles of Distributed Computing, ACM Press, New York (2003)
10. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communicationefficient leader election and consensus with limited link synchrony. In: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 328-337. ACM Press, New York (2004)
11. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Stable leader election. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 108-122. Springer, Heidelberg (2001)
12. Malkhi, D., Oprea, F., Zhou, L.: Ω meets paxos: Leader election and stability without eventual timely links. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 199-213. Springer, Heidelberg (2005)
13. Hutle, M., Malkhi, D., Schmid, U., Zhou, L.: Brief announcement: Chasing the weakest system model for implementing Q and consensus. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 576-577. Springer, Heidelberg (2006)
14. Attiya, H., Welch, J.: Distributed Computing, 2nd edn. John Wiley & Sons, Chichester (2004)
15. Lynch, N.: Distributed Algorithms. Morgan Kaufman Publishers, San Francisco (1996)
16. Hutle, M., Schiper, A.: Communication predicates: A high-level abstraction for coping with transient and dynamic faults. In: DSN 2007. Dependable Systems and Networks, pp. 92-101 (2007)
17. Biely, M., Widder, J.: Optimal message-driven implementation of Omega with mute processes. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 110-121. Springer, Heidelberg (2006)
18. Basu, A., Charron-Bost, B., Toueg, S.: Simulating reliable links with unreliable links in the presence of process crashes. In: Babaoglu, O., Marzullo, K. (eds.) WDAG 1996. LNCS, vol. 1151, pp. 105-122. Springer, Heidelberg (1996)
19. Mattern, F.: On the relativistic structure of logical time in distributed systems (1992)
20. Santoro, N., Widmayer, P.: Time is not a healer. In: Cori, R., Monien, B. (eds.) STACS 1989. LNCS, vol. 349, pp. 304-313. Springer, Heidelberg (1989)
21. Charron-Bost, B., Schiper, A.: The heard-of model: Unifying all benign failures. Technical Report LSR-REPORT-2006-004, EPFL (2006)
22. Biely, M., Hutle, M., Penso, L.D., Widder, J.: Relating stabilizing timing assumptions to stabilizing failure detectors regarding solvability and efficiency. Technical Report 54/2007, Technische Universität Wien, Institut für Technische Informatik, Treitlstrasse 3, 2nd floor, 1040 Wien, E.U. (August 2007)
23. Gärtner, F.C., Pleisch, S.: Failure detection sequencers: Necessary and sufficient information about failures to solve predicate detection. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 280-294. Springer, Heidelberg (2002)
24. Fetzer, C., Schmid, U., Süßkraut, M.: On the possibility of consensus in asynchronous systems with finite average response times. In: ICDCS 2005. Proceedings of the 25th International Conference on Distributed Computing Systems, pp. 271-280. IEEE Computer Society Press, Los Alamitos (2005)
25. Dutta, P., Guerraoui, R., Keidar, I.: The overhead of consensus failure recovery. Distributed Computing 19, 373-386 (2007)
26. Dutta, P., Guerraoui, R., Lamport, L.: How fast can eventual synchrony lead to consensus? In: Proceedings of the 2005 International Conference on Dependable Systems and Networks, pp. 22-27 (2005)