Tentative and definite distributed computations: An optimistic approach to network synchronization

DOI10.1016/0304-3975(94)90164-3zbMath0938.68955OpenAlexW2080127746MaRDI QIDQ1330420

B. Tampakas, Sergio Rajsbaum, J. Garofalakis, Paul G. Spirakis

Publication date: 21 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90164-3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Related Items (1)

A tight analysis and near-optimal instances of the algorithm of Anderson and Woll

Cites Work

• Unnamed Item
• The use of a synchronizer yields the maximum computation rate in distributed networks
• Marked directed graphs
• Complexity of network synchronization
• An Optimal Synchronizer for the Hypercube

This page was built for publication: Tentative and definite distributed computations: An optimistic approach to network synchronization