CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Tribes Is Hard in the Message Passing Model
Authors
Arkadev Chattopadhyay
Sagnik Mukhopadhyay
Publication date
1 January 2015
Publisher
Doi
Cite
View
on
arXiv
Abstract
We consider the point-to-point message passing model of communication in which there are
k
k
k
processors with individual private inputs, each
n
n
n
-bit long. Each processor is located at the node of an underlying undirected graph and has access to private random coins. An edge of the graph is a private channel of communication between its endpoints. The processors have to compute a given function of all their inputs by communicating along these channels. While this model has been widely used in distributed computing, strong lower bounds on the amount of communication needed to compute simple functions have just begun to appear. In this work, we prove a tight lower bound of
Ω
(
k
n
)
\Omega(kn)
Ω
(
kn
)
on the communication needed for computing the Tribes function, when the underlying graph is a star of
k
+
1
k+1
k
+
1
nodes that has
k
k
k
leaves with inputs and a center with no input. Lower bound on this topology easily implies comparable bounds for others. Our lower bounds are obtained by building upon the recent information theoretic techniques of Braverman et.al (FOCS'13) and combining it with the earlier work of Jayram, Kumar and Sivakumar (STOC'03). This approach yields information complexity bounds that is of independent interest
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Dagstuhl Research Online Publication Server
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:drops-oai.dagstuhl.de:4916
Last time updated on 17/11/2016