Abstract
We present a randomized distributed maximal independent set (MIS) algorithm for arbitrary graphs of size n that halts in time O(logn) with probability 1 − o(n − 1), each message containing 1 bit: thus its bit complexity per channel is O(logn) (the bit complexity is the number of bits we need to solve a distributed task, it measures the communication complexity). We assume that the graph is anonymous: unique identities are not available to distinguish the processes; we only assume that each vertex distinguishes between its neighbours by locally known channel names. Furthermore we do not assume that the size (or an upper bound on the size) of the graph is known. This algorithm is optimal (modulo a multiplicative constant) for the bit complexity and improves the best previous randomized distributed MIS algorithms (deduced from the randomized PRAM algorithm due to Luby [Lub86]) for general graphs which is O(log2 n) per channel (it halts in time O(logn) and the size of each message is logn). This result is based on a powerful and general technique for converting unrealistic exchanges of messages containing real numbers drawn at random on each vertex of a network into exchanges of bits. Then we consider a natural question: what is the impact of a vertex inclusion in the MIS on distant vertices? We prove that this impact vanishes rapidly as the distance grows for bounded-degree vertices. We provide a counter-example that shows this result does not hold in general. We prove also that these results remain valid for Luby’s algorithm presented by Lynch [Lyn96] and by Wattenhofer [Wat07]. This question remains open for the variant given by Peleg [Pel00].
This work was supported by grant No ANR-06-SETI-015-03 awarded by Agence Nationale de la Recherche.
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
Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set. Journal of Algorithms 7(4), 567–583 (1986)
Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network decomposition and locality in distributed computation. In: Proceedings of the 30th ACM Symposium on FOCS, pp. 364–369. ACM Press, New York (1989)
Bodlaender, H.L., Moran, S., Warmuth, M.K.: The distributed bit complexity of the ring: from the anonymous case to the non-anonymous case. Information and computation 114(2), 34–50 (1994)
Dinitz, Y., Moran, S., Rajsbaum, S.: Bit complexity of breaking and achieving symmetry in chains and rings. Journal of the ACM 55(1) (2008)
Ghosh, S.: Distributed systems - An algorithmic approach. CRC Press, Boca Raton (2006)
Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 273–287. Springer, Heidelberg (2005)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proceedings of the 24 Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 300–309 (2004)
Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, Cambridge (1999)
Kothapalli, K., Onus, M., Scheideler, C., Schindelhauer, C.: Distributed coloring in o/spl tilde/(/spl radic/(log n)) bit rounds. In: Proceedings of 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Rhodes Island, Greece, April 25-29. IEEE, Los Alamitos (2006)
Karp, R.M., Widgerson, A.: A fast parallel algorithm for the maximal independent set problem. In: Proceedings of the 16th ACM Symposium on Theory of computing (STOC), pp. 266–272. ACM Press, New York (1984)
Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In: Proceedings of the 25 Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 7–15. ACM Press, New York (2006)
Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21, 193–201 (1992)
Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15, 1036–1053 (1986)
Lynch, N.A.: Distributed algorithms. Morgan Kaufmann, San Francisco (1996)
Moscibroda, T., Wattenhofer, R.: Maximal independent set in radio networks. In: Proceedings of the 25 Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 148–157. ACM Press, New York (2005)
Naor, M., Stockmeyer, L.J.: What can be computed locally? SIAM J. Comput. 24(6), 1259–1277 (1995)
Peleg, D.: Distributed computing - A Locality-sensitive approach. SIAM Monographs on discrete mathematics and applications (2000)
Santoro, N.: Design and analysis of distributed algorithms. Wiley, Chichester (2007)
Tel, G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (2000)
Wattenhofer, R. (2007), http://dcg.ethz.ch/lectures/fs08/distcomp/lecture/chapter4.pdf
Yao, A.C.: Some complexity questions related to distributed computing. In: Proceedings of the 11th ACM Symposium on Theory of computing (STOC), pp. 209–213. ACM Press, New York (1979)
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
Yves, M., Robson, J.M., Nasser, SD., Zemmari, A. (2010). An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract). In: Kutten, S., Žerovnik, J. (eds) Structural Information and Communication Complexity. SIROCCO 2009. Lecture Notes in Computer Science, vol 5869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11476-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-11476-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11475-5
Online ISBN: 978-3-642-11476-2
eBook Packages: Computer ScienceComputer Science (R0)