Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
When Distributed Computation Is Communication Expensive
verfasst von : David P. Woodruff, Qin Zhang
Erschienen in: Distributed Computing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We consider a number of fundamental statistical and graph problems in the message-passing model, where we have
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
data sets. The communication is point-to-point, and the goal is to minimize the total communication among the
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.