Lower Bounds on Information Transfer in Distributed Computations-Reference-Cited by-同舟云学术

Lower Bounds on Information Transfer in Distributed Computations

Published:1980-04 Issue:2 Volume:27 Page:384-392
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Abelson Harold¹

Affiliation:

1. Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/322186.322200

Reference5 articles.

1. a theory of local and global in computation;ABELSON H.;J. Theoret. Comptr. Sct.,1978

2. ABELSON H. Correction to: Towards a theory of local and global in computation. ~ Theoret Comptr Sct. To appear. ABELSON H. Correction to: Towards a theory of local and global in computation. ~ Theoret Comptr Sct. To appear.

3. GENTLEMAN W.i.Some complexity results for matrix computauons on parallel processors J A CM 25 1 (Jan. 1978) 112-115. 10.1145/322047.322057 GENTLEMAN W.i.Some complexity results for matrix computauons on parallel processors J A CM 25 1 (Jan. 1978) 112-115. 10.1145/322047.322057

4. A note on the interrelation of subsets of independent variables of a continuous functton with continuous first derivatives Bull Am Math;LEONTIEF W;Soc,1947

5. Some complexity questions related to distributive computing(Preliminary Report)

Cited by 40 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Communication-Efficient Quantum Algorithm for Distributed Machine Learning;Physical Review Letters;2023-04-12

2. Strength of the non-locality of two-qubit entangled states and its applications;Physica Scripta;2023-04-06

3. The Layer Complexity of Arthur-Merlin-like Communication;Theory of Computing;2021

4. On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols;SIAM Journal on Discrete Mathematics;2016-01

5. CAN QUANTUM MECHANICS HELP DISTRIBUTED COMPUTING?;International Journal of Quantum Information;2010-02