Algebraic methods in the congested clique
نویسندگان
چکیده
منابع مشابه
Graph Reconstruction in the Congested Clique
The congested clique model is a message-passing model of distributed computation where the underlying communication network is the complete graph of n nodes. In this paper we consider the situation where the joint input to the nodes is an nnode labeled graph G, i.e., the local input received by each node is the indicator function of its neighborhood in G. Nodes execute an algorithm, communicati...
متن کاملDeterministic MST Sparsification in the Congested Clique
We give a simple deterministic constant-round algorithm in the congested clique model for reducing the number of edges in a graph to n1+ε while preserving the minimum spanning forest, where ε > 0 is any constant. This implies that in the congested clique model, it is sufficient to improve MST and other connectivity algorithms on graphs with slightly superlinear number of edges to obtain a gener...
متن کاملFurther Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems
Censor-Hillel et al. [PODC’15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in the past few years. This paper develops further algebraic techniques for designing algorithms in this model. We present deterministic and randomized algorit...
متن کاملBrief Announcement: Semi-MapReduce Meets Congested Clique
Graph problems are troublesome when it comes to MapReduce. Typically, to be able to design algorithms that make use of the advantages of MapReduce, assumptions beyond what the model imposes, such as the density of the input graph, are required. In a recent shift, a simple and robust model of MapReduce for graph problems, where the space per machine is set to be O(|V |) has attracted considerabl...
متن کاملMSF and Connectivity in Limited Variants of the Congested Clique
The congested clique is a synchronous, message-passing model of distributed computing in which each computational unit (node) in each round can send message of O(log n) bits to each other node of the network, where n is the number of nodes. This model has been considered under two extreme scanarios: unicast or broadcast. In the unicast model, a node can send (possibly) different message to each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2016
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-016-0270-2