Robust network supercomputing without centralized control

Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations


Internet supercomputing provides means for harnessing the power of a vast number of interconnected computers. With this come the challenges of marshaling distributed resources and dealing with failures. Traditional centralized approaches employ a master processor and many worker processors that execute a collection of tasks on behalf of the master. Despite the simplicity and advantages of centralized schemes, the master processor is a performance bottleneck and a single point of failure. Additionally, a phenomenon of increasing concern is that workers may return incorrect results, e.g., due to unintended failures, over-clocked processors, or due to workers claiming to have performed work to obtain a high rank in the system. This paper develops an original approach that eliminates the master and instead uses a decentralized algorithm, where workers cooperate in performing tasks. The failure model assumes that the average probability of a worker returning a wrong result is inferior to 1/2. We present a randomized synchronous algorithm for n processors and t tasks (t ≥ n) achieving time complexity Θ(t/n log n) and work Θ(t log n). It is shown that upon termination the workers know the results of all tasks with high probability, and that these results are correct with high probability. The message complexity of the algorithm is Θ(n log n), and the bit complexity is O(tn log 3n). Simulations illustrate the behavior of the algorithm under realistic assumptions.

Original languageEnglish (US)
Title of host publicationPrinciples of Distributed Systems - 15th International Conference, OPODIS 2011, Proceedings
Number of pages16
StatePublished - 2011
Externally publishedYes
Event15th International Conference on Principles of Distributed Systems, OPODIS 2011 - Toulouse, France
Duration: Dec 13 2011Dec 16 2011

Publication series

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


Conference15th International Conference on Principles of Distributed Systems, OPODIS 2011


  • Distributed Algorithms
  • Fault-Tolerance
  • Internet Supercomputing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Robust network supercomputing without centralized control'. Together they form a unique fingerprint.

Cite this