License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2019.49
URN: urn:nbn:de:0030-drops-113566
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11356/
Go to the corresponding LIPIcs Volume Portal

Mashreghi, Ali ; King, Valerie

Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication

pdf-format:
LIPIcs-DISC-2019-49.pdf (0.3 MB)

Abstract

Building a spanning tree, minimum spanning tree (MST), and BFS tree in a distributed network are fundamental problems which are still not fully understood in terms of time and communication cost. The first work to succeed in computing a spanning tree with communication sublinear in the number of edges in an asynchronous CONGEST network appeared in DISC 2018. That algorithm which constructs an MST is sequential in the worst case; its running time is proportional to the total number of messages sent. Our paper matches its message complexity but brings the running time down to linear in n. Our techniques can also be used to provide an asynchronous algorithm with sublinear communication to construct a tree in which the distance from a source to each node is within an additive term of sqrt{n} of its actual distance.

BibTeX - Entry

@InProceedings{mashreghi_et_al:LIPIcs:2019:11356,
  author =	{Ali Mashreghi and Valerie King},
  title =	{{Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication}},
  booktitle =	{33rd International Symposium on Distributed Computing (DISC 2019)},
  pages =	{49:1--49:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-126-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{146},
  editor =	{Jukka Suomela},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11356},
  URN =		{urn:nbn:de:0030-drops-113566},
  doi =		{10.4230/LIPIcs.DISC.2019.49},
  annote =	{Keywords: Distributed Computing, Minimum Spanning Tree, Broadcast Tree}
}

Keywords: Distributed Computing, Minimum Spanning Tree, Broadcast Tree
Collection: 33rd International Symposium on Distributed Computing (DISC 2019)
Issue Date: 2019
Date of publication: 08.10.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI