Complexity of Network Synchronization

Journal of the ACM (JACM)

Volumn 32, Issue 4, 1985, Pages 804-823

  Awerbuch, Baruch ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Communication and time complexities; distributed algorithms; networks; synchronization

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

COMPLEXITY; NETWORK SYNCHRONIZATION;

COMPUTER NETWORKS;

EID: 0022144867     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/4221.4227     Document Type: Article

References (12)

1. Arjomandi, E., Fisher, M. J., and Lynch, N. A. A difference in efficiency between synchronous and asynchronous systems. J. ACM 30, 3 (July 1983), 449-456.
2. Awerbuch, B. Applications of the network synchronization for distributed BFS and Max-Flow algorithms. Preprint. To appear in Networks.
3. Bollobas, B. Extremal Graph Theory. Academic Press, New York, 1978.
4. Eckstein, D. Parallel processing using depth-first-search and breadth-first search. Ph.D. Dissertation, Dept, of Computer Science, University of Iowa, Iowa City, Iowa, 1977.
5. Even, S. Graph algorithms. Computer Science Press, Woodland Hills, Calif., 1979.
6. Gallager, R. G. Distributed minimum hop algorithms. Tech. Rep. LIDS-P-1175, M.I.T., Cambridge, Mass., Jan. 1982.
7. Gallager, R. G., Humblet, P. A., and Spira, P. M. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5, 1 (Jan. 1983), 66-77.
8. Lamport, L. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7 (1978), 558-565.
9. Schneider, F. Synchronization in distributed programs. ACM Trans. Program. Lang. Syst. 4, 4 (Apr. 1982), 125-148.
10. Segall, A. Decentralized maximum flow algorithms. Networks 12 (1982), 213-230.
11. Segall, A. Distributed network protocols. IEEE Trans. Inf. Theory IT-29, 1 (Jan. 1983), 23-25.
12. Shiloach, Y., and Vishkin, U. An O(n2log n) parallel MAX-FLOW algorithm. J. Algorithms. 3 (1982), 128-146.