On the complexity of network synchronization

DOI10.1007/978-3-540-30551-4_44MaRDI QIDQ5712139zbMATH OpenOpenAlexFDO

Authors Darin Goldstein, Kojiro Kobayashi

Publication date 22 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104582

Mathematics Subject Classification ID

Distributed systems (68M14) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the Complexity of Network Synchronization
• On minimal-time solutions of firing squad synchronization problems for networks
• Complexity of network synchronization
• On the Complexity of the “Most General” Undirected Firing Squad Synchronization Problem
• On the Complexity of the “Most General” Firing Squad Synchronization Problem

Cited in

(9)

• The synchronization problem in protocol testing and its complexity
• A complexity-based classification for multiprocessor synchronization
• Complexity of network synchronization
• On the Multihop Performance of Synchronization Mechanisms in High Propagation Delay Networks
• The lower bound of the network connectivity guaranteeing in-phase synchronization
• scientific article; zbMATH DE number 975327 (Why is no real title available?)
• Fundamental Limits on Synchronizing Clocks Over Networks
• On the Complexity of Network Synchronization
• Tradeoff analysis between synchronization time and energy consumption for multi-layer networks

This page was built for publication: On the complexity of network synchronization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712139)