Topology-independent algorithms based on spanning trees
暂无分享,去创建一个
We consider a class of distributed algorithms. Algorithms in this class consist of processes that communicate using a broadcast. We show that local information suffices to implement such an algorithm on an arbitrary network. We investigate the time complexity and present some experimental results.
[1] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.
[2] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.
[3] K. Mani Chandy,et al. Distributed computation on graphs: shortest path algorithms , 1982, CACM.
[4] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.