The use of a synchronizer yields maximum computation rate in distributed networks

Authors:
S. Even;S. Rajsbaum
Affiliations:
Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel 32000 and Computer Science Program, University of Texas at Dallas, Richardson, TX;Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel 32000 and Computer Science Program, University of Texas at Dallas, Richardson, TX
Venue:
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Year:
1990

Cost-sensitive analysis of communication protocols

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Adapting to asynchronous dynamic networks (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Analysis of free schedule in periodic graphs

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Dynamic Min-Max Problems

Discrete Event Dynamic Systems
On the Performance of Synchronized Programs in Distributed Networks with Random Processing Times and Transmission Delays

IEEE Transactions on Parallel and Distributed Systems
Time-message trade-offs for the weak unison problem

Nordic Journal of Computing

Hi-index	0.00