We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Lower Bounds on Information Transfer in Distributed Computations

Thumbnail Image
Download
Name

MIT-LCS-TM-102.pdf

Size

2.55 MB

Format

Adobe PDF

Checksum (MD5)

6c1d70b4bab7e864f372178a757a9dbe

Author(s)
Abelson, Harold
Date Issued
April 1978
Series/Report no.
MIT-LCS-TM-102
Abstract
We derive a lower bound on the interprocessor information transfer required for computing a function in a distributed network. The bound is expressed in terms of the function's derivatives, and we use it to exhibit functions whose computation requires a great deal of interprocess communication. As a sample application, we give lower bounds on information transfer in the distributed computation of some typical matrix operations.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.