Energy-efficient distributed algorithms for synchronous networks

DOI10.1007/978-3-031-32733-9_21arXiv2301.11988OpenAlexW4377971912MaRDI QIDQ6148079

Ivan Rapaport, Ioan Todinca, Pedro Montealegre, Pierre Fraigniaud

Publication date: 11 January 2024

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.11988

zbMATH Keywords

energy efficiencysynchronous distributed algorithmsLOCAL and CONGEST models

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• On the power of the congested clique model
• Rounds in Communication Complexity Revisited
• Distributed Computing: A Locality-Sensitive Approach
• Communication Complexity
• The Energy Complexity of Broadcast
• Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)
• Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity

This page was built for publication: Energy-efficient distributed algorithms for synchronous networks