Faster computation on directed networks of automata
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Computing with snakes in directed networks of automata
Journal of Algorithms
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
The wake up and report problem is time-equivalent to the firing squad synchronization problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computer
Computation: finite and infinite machines
Computation: finite and infinite machines
Hi-index | 0.89 |
We consider strongly-connected, directed networks of identical synchronous, finite-state processors with in- and outdegree uniformly bounded by a network constant. Via a straightforward extension of Ostrovsky and Wilkerson's Backwards Communication Algorithm [Proc. 14th Annual Symp. on Principles of Distributed Computing, 1995], we exhibit a protocol which solves the Global Topology Determination Problem, the problem of having a root processor map the global topology of a network of unknown size and topology, with running time O(ND) where N represents the number of processors and D represents the diameter of the network. A simple counting argument suffices to show that the Global Topology Determination Problem has time-complexity Ω(N log N) which makes the protocol presented asymptotically time-optimal for many large networks.