On the Complexity of Network Synchronization

DOI10.1137/S0097539705447086MaRDI QIDQ5470703zbMATH OpenOpenAlexFDO

Authors Darin Goldstein, Kojiro Kobayashi

Publication date 1 June 2006

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539705447086

zbMATH Keywords

distributed computationfiring squad synchronization problemnetwork synchronization

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• Algorithms and Computation
• 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

(10)

• The synchronization problem in protocol testing and its complexity
• The minimum firing time of the generalized firing squad synchronization problem for squares
• Minimum and non-minimum time solutions to the firing squad synchronization problem
• 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
• Algorithms and Computation
• 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 Q5470703)