Lower Bounds On Communication Complexity In Distributed Computer Networks

We prove that for almost all boolean functions f , the conmunication complexity of f on a linear array with p+1 processors is approximately p times its commuication complexity on a system with two processors. We use this result to develop a technique for establishing lower bounds on communication co...

Full description

Saved in:
Bibliographic Details
Published in25th Annual Symposium onFoundations of Computer Science, 1984 pp. 109 - 117
Main Author Tiwari, P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1984
Subjects
Complexity theory
Computer networks
Computer simulation
Coordinate measuring machines
Distributed algorithms
Distributed computing
Electric variables measurement
Intelligent networks
Optical computing
Repeaters
Online AccessGet full text

Cover

More Information
Summary:We prove that for almost all boolean functions f , the conmunication complexity of f on a linear array with p+1 processors is approximately p times its commuication complexity on a system with two processors. We use this result to develop a technique for establishing lower bounds on communication complexity on general networks by simulating them on linear arrays. Using this technique, we derive optimal lower bounds for ranking, distinctness, uniqueness and triangle-detection problems on the ring. The application of this technique to meshes and trees yields nontrivial near optimal lower bounds on the communicaton complexity of ranking and distinctness problems on these networks.
ISBN:081860591X
9780818605918
ISSN:0272-5428
DOI:10.1109/SFCS.1984.715907