Faster Computation On Directed Networks of Automata

TitleFaster Computation On Directed Networks of Automata
Publication TypeTechnical Report
Year of Publication1994
AuthorsOstrovsky, R., & Wilkerson D.
Other Numbers907

We show how an arbitrary strongly-connected {em directed} network of synchronous finite-state automata (with bounded in- and out-degree) can accomplish a number of basic distributed network tasks in O(ND) time, where D is the diameter of the network and N is the number of processors. The tasks include (among others) the Firing Synchronization Problem; Network Search and Traversal; building outgoing and incoming Spanning Trees; Wake-up and Report When Done; and simulating a step of an undirected network protocol for the underlying graph of the directed network. Our approach compares favorably to the best previously known O(N^2) algorithms of Even, Litman and Winkler for all these problems.

Bibliographic Notes

ICSI Technical Report TR-94-037

Abbreviated Authors

R. Ostrovsky and D. Wilkerson

ICSI Publication Type

Technical Report