Sparser: A paradigm for running distributed algorithms

Yehuda Afek, Moty Ricklin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


This paper introduces a transformer for improving the communication complexity of several classes of distributed algorithms. The transformer takes a distributed algorithm whose message complexity is O(f · m) and produces a new distributed algorithm for the same problem with O(f · n log n + m log n) message complexity, where n and m are the total number of nodes and links in the network, and f is an arbitrary function of n and m. Applying our paradigm to the standard all shortest paths algorithm [15, 16, 22] yields a new algorithm which solves the problem in O(n2log n) messages (The previous best that we know of is O(m · n) messages). When applied to the O(m · polylogn) breadth-first search algorithm of Awerbuch and Peleg [8] our paradigm yields an O(m+n · polylogn) messages algorithm.

Original languageEnglish
Title of host publicationDistributed Algorithms - 6th International Workshop, WDAG 1992, Proceedings
EditorsAdrian Segall, Shmuel Zaks
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540561880
StatePublished - 1992
Event6th International Workshop on Distributed Algorithms, WDAG 1992 - Haifa, Israel
Duration: 2 Nov 19924 Nov 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume647 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th International Workshop on Distributed Algorithms, WDAG 1992


Dive into the research topics of 'Sparser: A paradigm for running distributed algorithms'. Together they form a unique fingerprint.

Cite this