Efficient parallelism vs reliable distribution: A trade-off for concurrent computations

Paris C. Kanellakis, Dimitrios Michailidis, Alex A. Shvartsman

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

2 Scopus citations

Abstract

Concurrent computations should combine efficiency with reliability, where efficiency is usually associated with parallel and reliability wiih distributed computing. Such a desirable combination is not always possible, because of an intuitive trade-o:ff: efficiency requires removing redundancy from computations whereas reliability requires some redundancy. We survey a spectrum of algorithmic models (from fail-stop, synchronous to asynchronous and from approximate to exact computations) in which reliability is guaranteed with small trade-o:ffs in efficiency. We illustrate a number of cases where optimal trade-o:ffs are achievable. A basic property of all these models, which is of some interest in the study of concurrency, is that “true” read/write concurrency is necessary for fault tolerance. In particular, we outline (from [14]) how algorithms can be designed so that, in each execution, the total “true” concurrency used can be closely related to the faults that can be tolerated.

Original languageEnglish (US)
Title of host publicationCONCUR 1994
Subtitle of host publicationConcurrency Theory - 5th International Conference, Proceedings
EditorsBengt Jonsson, Joachim Parrow
PublisherSpringer Verlag
Pages242-266
Number of pages25
ISBN (Print)9783540583295
DOIs
StatePublished - 1994
Externally publishedYes
Event5th International Conference on Concurrency Theory, CONCUR 1994 - Uppsala, Sweden
Duration: Aug 22 1994Aug 25 1994

Publication series

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

Conference

Conference5th International Conference on Concurrency Theory, CONCUR 1994
Country/TerritorySweden
CityUppsala
Period8/22/948/25/94

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Efficient parallelism vs reliable distribution: A trade-off for concurrent computations'. Together they form a unique fingerprint.

Cite this