Corpus ID: 29155467

Distributed Computation in the Node-Congested Clique

  title={Distributed Computation in the Node-Congested Clique},
  author={J. Augustine and M. Ghaffari and R. Gmyr and Kristian Hinnenthal and F. Kuhn and J. Li and C. Scheideler},
  • J. Augustine, M. Ghaffari, +4 authors C. Scheideler
  • Published 2018
  • Computer Science
  • ArXiv
  • The Congested Clique model of distributed computing, which was introduced by Lotker, Patt-Shamir, Pavlov, and Peleg [SPAA'03, SICOMP'05] and was motivated as "a simple model for overlay networks", has received extensive attention over the past few years. In this model, nodes of the system are connected as a clique and can communicate in synchronous rounds, where per round each node can send $O(\log n)$ bits to each other node, all the same time. The fact that this model allows each node to send… CONTINUE READING
    1 Citations
    Random Sampling Applied to the MST Problem in the Node Congested Clique Model
    • 1
    • Highly Influenced
    • PDF


    On the power of the congested clique model
    • 146
    • PDF
    Distributed Symmetry-Breaking Algorithms for Congested Cliques
    • 10
    • PDF
    Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
    • 33
    • Highly Influential
    • PDF
    Distributed MIS via All-to-All Communication
    • 34
    • PDF
    MST in O(1) Rounds of Congested Clique
    • 68
    • PDF
    Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems
    • F. Gall
    • Computer Science, Mathematics
    • DISC
    • 2016
    • 31
    • PDF
    MST in Log-Star Rounds of Congested Clique
    • 63
    • PDF
    Lessons from the Congested Clique applied to MapReduce
    • 44
    • PDF
    Distributed Computation of Large-scale Graph Problems
    • 72
    • PDF
    Brief Announcement: Towards a Complexity Theory for the Congested Clique
    • 13
    • PDF