Abstract
We study strategies that minimize the instability of a fault-tolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes over a random walk sequence of input vectors (where each component of the vector corresponds to a particular sensor reading). We analyze the case where each sensor can read three possible inputs. The proof of this result appears to be much more complex than the proof of the binary case (previous work). In the binary case the problem can be reduced to a minimal cut in a graph. We succeed in three dimensions by using the fact that an auxiliary graph (projected graph) is planar. For four and higher dimensions this auxiliary graph is not planar anymore and the problem remains open.
Partially supported by Programs Fondecyt 1090156, Basal-CMM, Instituto Milenio ICDB, Ecos C09E04 and IXXI (Complex System Institute, Lyon).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Becker, F., Rajsbaum, S., Rapaport, I., Rémila, E.: Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 48–60. Springer, Heidelberg (2008)
Berman, P., Garay, J.: Cloture votes: n/4-resilient distributed consensus in t + 1 rounds. Math. Sys. Theory 26(1), 3–19 (1993)
Chandrakasan, A.P., Brodersen, R.W.: Low power digital CMOS design. Kluwer Academic Publishes, Dordrecht (1995)
Cohen, D.I.A.: On the Sperner lemma. J. Combin. Theory 2, 585–587 (1967)
Dalhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, P.: The Complexity of Multiterminal Cuts. SIAM J. on Computing 23(4), 864–894 (1994)
Davidovitch, L., Dolev, S., Rajsbaum, S.: Stability of Multi-Valued Continuous Consensus. SIAM J. on Computing 37(4), 1057–1076 (2007)
Dolev, S.: Self-Stabilization, March 2000. MIT Press, Cambridge (2000)
Dolev, S., Rajsbaum, S.: Stability of Long-lived Consensus. J. of Computer and System Sciences 67(1), 26–45 (2003); Preliminary version in Proc. of the 19th Annual ACM Symp. on Principles of Distributed Computing (PODC 2000), pp. 309–318 (2000)
Jordan, C.: Cours d’analyse, Ecole Polytechnique, pp. 587–594 (1887)
Kahn, J., Kalai, G., Linial, N.: The Influence of Variables on Boolean Functions. In: Proc. of the IEEE FOCS, pp. 68–80 (1988)
Kutten, S., Masuzawa, T.: Output Stability Versus Time Till Output. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 343–357. Springer, Heidelberg (2007)
Kopetz, H., Veríssimo, P.: Real Time and Dependability Concepts. In: Mullender, S. (ed.) Distributed Systems, ch. 16, pp. 411–446. ACM Press, New York (1993)
Maehara, R.: The Jordan Curve Theorem via the Brouwer Fixed Point Theorem. American Mathematical Monthly 91, 641–643 (1984)
Musoll, E., Lang, T., Cortadella, J.: Exploiting the locality of memory references to reduce the address bus energy. In: Proc. of the Int. Symp. on Low Power Electronics and Design, August 1997, pp. 202–207 (1997)
Norris, J.R.: Markov Chains, October 1998. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge (1998)
Sperner, E.: Neuer Beweis f .ur die Invarianz der Dimensionszahl und des Gebietes, Abh. Math. Sem. Univ. Hamburg 6, 265–272 (1928)
Su, C.-L., Tsui, C.-Y., Despain, A.M.: Saving power in the control path of embedded processors. IEEE Design & Test of Comp., 24–30 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rapaport, I., Rémila, E. (2010). Average Long-Lived Memoryless Consensus: The Three-Value Case. In: Patt-Shamir, B., Ekim, T. (eds) Structural Information and Communication Complexity. SIROCCO 2010. Lecture Notes in Computer Science, vol 6058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-13284-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13283-4
Online ISBN: 978-3-642-13284-1
eBook Packages: Computer ScienceComputer Science (R0)