Lower Bounds on Information Transfer in Distributed Computations

Authors:
Harold Abelson
Affiliations:
Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA
Venue:
Journal of the ACM (JACM)
Year:
1980

Citing 2
Cited 7

Some Complexity Results for Matrix Computations on Parallel Processors

Journal of the ACM (JACM)
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Lower bounds on communication complexity in distributed computer networks

Journal of the ACM (JACM)
Tradeoffs between communication and space

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the communication complexity of distributed algebraic computation

Journal of the ACM (JACM)
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata

Journal of Computer and System Sciences
Mesh-Connected Computers with Broadcasting

IEEE Transactions on Computers
Can quantum mechanics help distributed computing?

ACM SIGACT News
Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

Lower bounds on the interprocessor communication required for computing a differentiable real-valued function in a distributed network are derived. These bounds are independent of the network interconnection configuration, and they impose no assumptions other than differentiability constraints on the computations performed by individual processors. As a sample application, lower bounds on information transfer in the distributed computation of some-typical matrix operations are exhibited.