research-article

Feedback from nature: an optimal distributed algorithm for maximal independent set selection

Authors:

Lei XuAuthors Info & Claims

PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing

Pages 147 - 156

https://doi.org/10.1145/2484239.2484247

Published: 22 July 2013 Publication History

Abstract

Maximal Independent Set selection is a fundamental problem in distributed computing. A novel probabilistic algorithm for this problem has recently been proposed by Afek et al, inspired by the study of the way that developing cells in the fly become specialised. The algorithm they propose is simple and robust, but not as efficient as previous approaches: the expected time complexity is O(log² n). Here we first show that the approach of Afek et al cannot achieve better efficiency than this across all networks, no matter how the global probability values are chosen.

However, we then propose a new algorithm that incorporates another important feature of the biological system: the probability value at each node is adapted using local feedback from neighbouring nodes. Our new algorithm retains all the advantages of simplicity and robustness, but also achieves the optimal efficiency of O(log n) expected time. The new algorithm also has only a constant message complexity per node.

References

[1]

Y. Afek, N. Alon, Z. Bar-Joseph, A. Cornejo, B. Haeupler, and F. Kuhn. Beeping a maximal independent set. In Proceedings of the 25th international conference on Distributed Computing, DISC'11, pages 32--50, Berlin, Heidelberg, 2011. Springer-Verlag.

Digital Library

[2]

Y. Afek, N. Alon, O. Barad, E. Hornstein, N. Barkai, and Z. Bar-Joseph. A biological solution to a fundamental distributed computing problem. Science, 331(6014):183--185, 2011.

[3]

N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms, 7:567--583, December 1986.

Digital Library

[4]

O. Barad, E. Hornstein, and N. Barkai. Robust selection of sensory organ precursors by the Notch-Delta pathway. Current Opinion in Cell Biology, 23(6):663--667, 2011.

[5]

O. Barad, D. Rosin, E. Hornstein, and N. Barkai. Error minimization in lateral inhibition circuits. Science Signaling, 3(129):ra51, 2010.

[6]

S. J. Bray. Notch signalling: a simple pathway becomes complex. Nature reviews. Molecular cell biology, 7(9):678--689, Sept. 2006.

[7]

J. R. Collier, N. A. M. Monk, P. K. Maini, and J. H. Lewis. Pattern formation by lateral inhibition with feedback: a mathematical model of Delta-Notch intercellular signalling. Journal of Theoretical Biology, 183(4):429--446, 1996.

[8]

R. Ghosh and C. J. Tomlin. Lateral inhibition through Delta-Notch signaling: a piecewise affine hybrid model. In Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control, HSCC '01, pages 232--246, London, UK, 2001. Springer-Verlag.

Digital Library

[9]

K. G. Guruharsha, M. W. Kankel, and S. Artavanis-Tsakonas. The Notch signalling system: recent insights into the complexity of a conserved pathway. Nature Reviews. Genetics, 13(9):654--666, Sept. 2012.

[10]

J. Håstad. Clique is hard to approximate within n^1-ε. Acta Mathematica, 48:105--142, 1999.

[11]

T. L. Jacobsen, K. Brennan, A. M. Arias, and M. A. T. Muskavitch. Cis-interactions between Delta and Notch modulate neurogenic signalling in Drosophila. Development, 125(22):4531--40, 1998.

[12]

R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, The IBM Research Symposia Series, pages 85--103. Plenum Press, New York, 1972.

[13]

F. Kuhn, T. Moscibroda, T. Nieberg, and R. Wattenhofer. Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In P. Fraigniaud, editor, Distributed Computing: 19th International Conference, DISC 2005, volume 3724 of Lecture Notes in Computer Science, pages 273--283, Berlin, November 2005. Springer-Verlag.

Digital Library

[14]

F. Kuhn, T. Moscibroda, and R. Wattenhofer. The price of being near-sighted. In Proceedings of the 17th annual ACM-SIAM Symposium on Discrete Algorithms, SODA '06, pages 980--989, New York, NY, USA, 2006.

Digital Library

[15]

N. Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193--201, Feb. 1992.

Digital Library

[16]

M. Luby. A simple parallel algorithm for the maximal independent set problem. In Proceedings of the seventeenth annual ACM Symposium on Theory of Computing, STOC '85, pages 1--10, New York, NY, USA, 1985.

Digital Library

[17]

M. Matsuda and A. B. Chitnis. Interaction with Notch determines endocytosis of specific Delta ligands in zebrafish neural tissue. Development, 136(2):197--206, 2009.

[18]

Y. Métivier, J. M. Robson, N. Saheb-Djahromi, and A. Zemmari. An optimal bit complexity randomized distributed MIS algorithm. Distributed Computing, 23:331--340, 2011.

Digital Library

[19]

T. Moscibroda and R. Wattenhofer. Maximal independent sets in radio networks. In Proceedings of the 24th annual ACM Symposium on Principles of Distributed Computing, PODC '05, pages 148--157, New York, NY, USA, 2005.

Digital Library

[20]

S. Navlakha and Z. Bar-Joseph. Algorithms in nature: the convergence of systems biology and computational thinking. Molecular Systems Biology, 7(1), Nov. 2011.

[21]

D. Sprinzak, A. Lakhanpal, L. LeBon, L. A. Santat, M. E. Fontes, G. A. Anderson, J. Garcia-Ojalvo, and M. B. Elowitz. Cis-interactions between Notch and Delta generate mutually exclusive signalling states. Nature, 465(7294):86--90, Apr. 2010.

Cited By

Emek YKeren EMiller ACensor-Hillel K(2021)A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological NetworksProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467922(93-102)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467922
Efremenko KKol GSaxena REmek YCachin C(2020)Noisy BeepsProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3404501(418-427)Online publication date: 31-Jul-2020
https://dl.acm.org/doi/10.1145/3382734.3404501
Feldmann MKhazraei AScheideler CScheideler CSpear M(2020)Time- and Space-Optimal Discrete Clock Synchronization in the Beeping ModelProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400246(223-233)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400246
Show More Cited By

Index Terms

Feedback from nature: an optimal distributed algorithm for maximal independent set selection
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Can We Break Symmetry with o(m) Communication?
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing

We study the communication cost (or message complexity) of fundamental distributed symmetry breaking problems, namely, coloring and MIS. While significant progress has been made in understanding and improving the running time of such problems, much less ...
Super-linear time-space tradeoff lower bounds for randomized computation
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science

We prove the first time-space lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques ...
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed Computing

We study local symmetry breaking problems in the Congest model, focusing on ruling set problems, which generalize the fundamental Maximal Independent Set (MIS) problem. Our work is motivated by the following central question: can we break the long-...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing

July 2013

422 pages

ISBN:9781450320658

DOI:10.1145/2484239

General Chair:
Panagiota Fatourou
FORTH ICS & University of Crete, Greece
,
Program Chair:
Gadi Taubenfeld
IDC, Israel

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 July 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PODC '13

Sponsor:

PODC '13: ACM Symposium on Principles of Distributed Computing

July 22 - 24, 2013

Québec, Montréal, Canada

Acceptance Rates

PODC '13 Paper Acceptance Rate 37 of 145 submissions, 26%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
353
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)1

Reflects downloads up to 04 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Emek YKeren EMiller ACensor-Hillel K(2021)A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological NetworksProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467922(93-102)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467922
Efremenko KKol GSaxena REmek YCachin C(2020)Noisy BeepsProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3404501(418-427)Online publication date: 31-Jul-2020
https://dl.acm.org/doi/10.1145/3382734.3404501
Feldmann MKhazraei AScheideler CScheideler CSpear M(2020)Time- and Space-Optimal Discrete Clock Synchronization in the Beeping ModelProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400246(223-233)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400246
Arapoglu ODagdeviren O(2020)Distributed Self-Stabilizing Capacitated Maximal Independent Set Construction in Wireless Sensor NetworksWireless Personal Communications10.1007/s11277-020-07528-3Online publication date: 15-Jun-2020
https://doi.org/10.1007/s11277-020-07528-3
Andriambolamalala NRavelomanana V(2019)Energy Efficient Naming in Beeping NetworksAd-Hoc, Mobile, and Wireless Networks10.1007/978-3-030-31831-4_25(355-369)Online publication date: 25-Sep-2019
https://doi.org/10.1007/978-3-030-31831-4_25
Beauquier JBurman JDufoulon FKutten S(2018)Fast Beeping Protocols for Deterministic MIS and (Δ + 1)-Coloring in Sparse GraphsIEEE INFOCOM 2018 - IEEE Conference on Computer Communications10.1109/INFOCOM.2018.8486015(1754-1762)Online publication date: Apr-2018
https://doi.org/10.1109/INFOCOM.2018.8486015
Ghaffari MSchiller ESchwarzmann A(2017)Distributed MIS via All-to-All CommunicationProceedings of the ACM Symposium on Principles of Distributed Computing10.1145/3087801.3087830(141-149)Online publication date: 25-Jul-2017
https://dl.acm.org/doi/10.1145/3087801.3087830
Gilbert SNewport CSchiller ESchwarzmann A(2017)Symmetry Breaking with Noisy ProcessesProceedings of the ACM Symposium on Principles of Distributed Computing10.1145/3087801.3087814(273-282)Online publication date: 25-Jul-2017
https://dl.acm.org/doi/10.1145/3087801.3087814
Métivier YRobson JZemmari A(2016)Randomised distributed MIS and colouring algorithms for rings with oriented edges in O ( log ź n ) bit roundsInformation and Computation10.1016/j.ic.2016.09.006251:C(208-214)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1016/j.ic.2016.09.006
Jeavons PScott AXu L(2016)Feedback from natureDistributed Computing10.1007/s00446-016-0269-829:5(377-393)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1007/s00446-016-0269-8
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten