Near-optimal scheduling in the congested clique
type: Item
instance of: scholarly article
title: Near-optimal scheduling in the congested clique
DOI: 10.1007/978-3-030-79527-6_4
author: Keren Censor-Hillel
author: Yannic Maus
author: Volodymyr Polosukhin
publication date: 2022-03-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/2102.07221
Mathematics Subject Classification ID: 68Mxx
Mathematics Subject Classification ID: 68Q11
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7495133
zbMATH Keywords: distributed algorithms
zbMATH Keywords: congested clique
zbMATH Keywords: scheduling
zbMATH Keywords: maximal independent set
MaRDI profile type: Publication
OpenAlex ID: W3175439416
cites work: Fast Approximate Shortest Paths in the Congested Clique
cites work: On Distributed Listing of Cliques
cites work: Algebraic methods in the congested clique
cites work: Derandomizing local distributed algorithms under bandwidth restrictions
cites work: Distributed Triangle Detection via Expander Decomposition
cites work: Simple, Deterministic, Constant-Round Coloring in the Congested Clique
cites work: “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
cites work: Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
cites work: Near-optimal scheduling of distributed algorithms
cites work: Distributed MIS via All-to-All Communication
cites work: Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
cites work: Congested Clique Algorithms for the Minimum Cut Problem
cites work: Faster Algorithms for Edge Connectivity via Random 2-Out Contractions
cites work: MST in Log-Star Rounds of Congested Clique
cites work: Toward optimal bounds in the congested clique, graph connectivity and MST
cites work: Q4146249
cites work: Triangle Finding and Listing in CONGEST Networks
cites work: Q4608063
cites work: Q5417679
cites work: Distributed Computation of Large-scale Graph Problems
cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
cites work: Optimal deterministic routing and sorting on the congested clique
cites work: Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
description: scientific article; zbMATH DE number 7495133