Distributed MIS with Low Energy and Time Complexities
Pages 146 - 156
Abstract
We present randomized distributed algorithms for the maximal independent set problem (MIS) that, while keeping the time complexity nearly matching the best known, reduce the energy complexity substantially. These algorithms work in the standard CONGEST model of distributed message passing with O(log n) bit messages. The time complexity measures the number of rounds in the algorithm. The energy complexity measures the number of rounds each node is awake; during other rounds, the node sleeps and cannot perform any computation or communications.
Our first algorithm has an energy complexity of O(log log n) and a time complexity of O(log2 n). Our second algorithm is faster but slightly less energy-efficient: it achieves an energy complexity of O(log2 log n) and a time complexity of O(log n · log log n · log* n). Thus, this algorithm nearly matches the O(log n) time complexity of the state-of-the-art MIS algorithms while significantly reducing their energy complexity from O(log n) to O(log2 log n).
References
[1]
Noga Alon, László Babai, and Alon Itai. 1986. A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of algorithms 7, 4 (1986), 567--583.
[2]
John Augustine, William K. Moses, Jr., and Gopal Pandurangan. 2022. Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (PODC). 51--53.
[3]
Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. 2021. Lower Bounds for Maximal Matchings and Maximal Independent Sets. Journal of the ACM (JACM) 68, 5 (2021), 1--30.
[4]
Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. 2016. The Locality of Distributed Symmetry Breaking. Journal of the ACM (JACM) 63, 3 (2016), 1--45.
[5]
Leonid Barenboim and Tzalik Maimon. 2021. Deterministic Logarithmic Completeness in the Distributed Sleeping Model. In 35th International Symposium on Distributed Computing, DISC 2021.
[6]
Leonid Barenboim and Tzalik Maimon. 2021. Deterministic Logarithmic Completeness in the Distributed Sleeping Model. arXiv preprint arXiv:2108.01963 (2021).
[7]
Otakar Borůvka. 1926. O jistém problému minimálním. (1926).
[8]
Yi-Jun Chang, Varsha Dani, Thomas P Hayes, Qizheng He, Wenzheng Li, and Seth Pettie. 2018. The energy complexity of broadcast. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. 95--104.
[9]
Yi-Jun Chang, Varsha Dani, Thomas P Hayes, and Seth Pettie. 2020. The energy complexity of BFS in radio networks. In Proceedings of the 39th Symposium on Principles of Distributed Computing. 273--282.
[10]
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, and Wei Zhan. 2017. Exponential Separations in the Energy Complexity of Leader Election. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. 771--783.
[11]
Soumyottam Chatterjee, Robert Gmyr, and Gopal Pandurangan. 2020. Sleeping is Efficient: MIS in O(1)-Rounds Node-Averaged Awake Complexity. In Proceedings of the 39th Symposium on Principles of Distributed Computing. 99--108.
[12]
Fabien Dufoulon, William K. Moses, Jr., and Gopal Pandurangan. 2023. Distributed MIS in O(log log n) Awake Complexity. In Proceedings of the 42nd Symposium on Principles of Distributed Computing. to appear.
[13]
Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, and Václav Rozhoň. 2023. Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. In Symposium on Discrete Algorithms (SODA). to appear, arXiv:2209.11651.
[14]
Robert G. Gallager, Pierre A. Humblet, and Philip M. Spira. 1983. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and systems (TOPLAS) 5, 1 (1983), 66--77.
[15]
Mohsen Ghaffari. 2016. An improved distributed algorithm for maximal independent set. In Proc. 27th ACM-SIAM Symp. on Discrete Algorithms (SODA). 270--277.
[16]
Mohsen Ghaffari. 2019. Distributed Maximal Independent Set using Small Messages. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. 805--820.
[17]
Mohsen Ghaffari, Christoph Grunau, and Václav Rozhoň. 2021. Improved Deterministic Network Decomposition. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). 2904--2923.
[18]
Mohsen Ghaffari and Julian Portmann. 2022. Average Awake Complexity of MIS and Matching. In Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures. 45--55.
[19]
Mohsen Ghaffari and Julian Portmann. 2023. Distributed MIS with Low Energy and Time Complexities. Technical Report 2305.11639. arXiv. Full version of this paper.
[20]
Khalid Hourani, Gopal Pandurangan, and Peter Robinson. 2022. Awake-Efficient Distributed Algorithms for Maximal Independent Set. In 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS). IEEE, 1338--1339.
[21]
Tomasz Jurdziński, Mirosław Kutyłowski, and Jan Zatopiański. 2002. Efficient algorithms for leader election in radio networks. In Proceedings of the twenty-first annual symposium on Principles of distributed computing. 51--57.
[22]
Tomasz Jurdziński, Mirosław Kutyłowski, and Jan Zatopiański. 2002. Energy-efficient size approximation of radio networks with no collision detection. In International Computing and Combinatorics Conference. Springer, 279--289.
[23]
Marcin Kardas, Marek Klonowski, and Dominik Pajak. 2013. Energy-efficient leader election protocols for single-hop radio networks. In 2013 42nd International Conference on Parallel Processing. IEEE, 399--408.
[24]
Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. 2016. Local Computation: Lower and Upper Bounds. J. ACM 63, 2 (2016).
[25]
Nati Linial. 1992. Locality in Distributed Graph Algorithms. SIAM J. Comput. 21, 1 (1992), 193--201.
[26]
Michael Luby. 1986. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 15 (1986), 1036--1053.
[27]
Rajeev Motwani and Prabhakar Raghavan. 1995. Randomized algorithms. Cambridge university press.
[28]
David Peleg. 2000. Distributed Computing: A Locality-Sensitive Approach. SIAM.
[29]
Václav Rozhoň and Mohsen Ghaffari. 2020. Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing.
Index Terms
- Distributed MIS with Low Energy and Time Complexities
Recommendations
Average Awake Complexity of MIS and Matching
SPAA '22: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and ArchitecturesChatterjee, Gmyr, and Pandurangan [PODC 2020] recently introduced the notion of awake complexity for distributed algorithms, which measures the number of rounds in which a node is awake. In the other rounds, the node is sleeping and performs no ...
Distributed MIS in O(log log n) Awake Complexity
PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed ComputingMaximal Independent Set (MIS) is one of the fundamental and most well-studied problems in distributed graph algorithms. Even after four decades of intensive research, the best known (randomized) MIS algorithms have O(log n) round complexity on general ...
Awake Complexity of Distributed Minimum Spanning Tree
Structural Information and Communication ComplexityAbstractThe awake complexity of a distributed algorithm measures the number of rounds in which a node is awake. When a node is not awake, it is sleeping and does not do any computation or communication and spends very little resources. Reducing the awake ...
Comments
Information & Contributors
Information
Published In
June 2023
392 pages
ISBN:9798400701214
DOI:10.1145/3583668
- Chair:
- Rotem Oshman,
- Proceedings Editor:
- Alexandre Nolin,
- Program Chair:
- Magnus Mar Halldorsson,
- Workshop Chair:
- Alkida Balliu
Copyright © 2023 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: 16 June 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
PODC '23: 2023 ACM Symposium on Principles of Distributed Computing
June 19 - 23, 2023
FL, Orlando, USA
Acceptance Rates
PODC '23 Paper Acceptance Rate 29 of 110 submissions, 26%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 117Total Downloads
- Downloads (Last 12 months)96
- Downloads (Last 6 weeks)3
Reflects downloads up to 12 Aug 2024
Other Metrics
Citations
Cited By
View allView Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in