Access the full text.
Sign up today, get DeepDyve free for 14 days.
E Kushilevitz, N Nisan (1997)
Communication Complexity
R Motwani, P Raghavan (1995)
Randomized Algorithms
LG Valiant (1990)
A bridging model for parallel computationCommun. ACM, 33
D Dor, S Halperin, U Zwick (2000)
All-pairs almost shortest pathsSIAM J. Comput., 29
G Cormode, S Muthukrishnan, K Yi (2011)
Algorithms for distributed functional monitoringACM Trans . Algorithms, 7
O Goldreich, S Goldwasser, D Ron (1998)
Property testing and its connection to learning and approximationJ. ACM, 45
P Flajolet, GN Martin (1985)
Probabilistic counting algorithms for data base applicationsJ. Comput. Syst. Sci., 31
We consider a number of fundamental statistical and graph problems in the message-passing model, where we have $$k$$ k machines (sites), each holding a piece of data, and the machines want to jointly solve a problem defined on the union of the $$k$$ k data sets. The communication is point-to-point, and the goal is to minimize the total communication among the $$k$$ k machines. This model captures all point-to-point distributed computational models with respect to minimizing communication costs. Our analysis shows that exact computation of many statistical and graph problems in this distributed setting requires a prohibitively large amount of communication, and often one cannot improve upon the communication of the simple protocol in which all machines send their data to a centralized server. Thus, in order to obtain protocols that are communication-efficient, one has to allow approximation, or investigate the distribution or layout of the data sets.
Distributed Computing – Springer Journals
Published: May 5, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.