Lower Bounds on Information Transfer in Distributed Computations

43Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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. © 1980, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Abelson, H. (1980). Lower Bounds on Information Transfer in Distributed Computations. Journal of the ACM (JACM), 27(2), 384–392. https://doi.org/10.1145/322186.322200

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free