Efficient parallelism vs reliable distribution: A trade-off for concurrent computations
Identifieur interne : 001424 ( Istex/Curation ); précédent : 001423; suivant : 001425Efficient parallelism vs reliable distribution: A trade-off for concurrent computations
Auteurs : C. Kanellakis [États-Unis] ; Dimitrios Michailidis [États-Unis] ; A. Shvartsman [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1994.
Abstract
Abstract: Concurrent computations should combine efficiency with reliability, where efficiency is usually associated with parallel and reliability with distributed computing. Such a desirable combination is not always possible, because of an intuitive trade-off: 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-offs in efficiency. We illustrate a number of cases where optimal trade-offs 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.
Url:
DOI: 10.1007/BFb0015013
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001511
Links to Exploration step
ISTEX:3F895B5160720CA1BEFBA8BFEFF2E09A0E94B396Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Efficient parallelism vs reliable distribution: A trade-off for concurrent computations</title><author><name sortKey="Kanellakis, C" sort="Kanellakis, C" uniqKey="Kanellakis C" first="C." last="Kanellakis">C. Kanellakis</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, Brown University, Box 1910, 02912-1910, Providence, RI, USA</mods:affiliation><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, Brown University, Box 1910, 02912-1910, Providence, RI</wicri:regionArea></affiliation></author><author><name sortKey="Michailidis, Dimitrios" sort="Michailidis, Dimitrios" uniqKey="Michailidis D" first="Dimitrios" last="Michailidis">Dimitrios Michailidis</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, Brown University, Box 1910, 02912-1910, Providence, RI, USA</mods:affiliation><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, Brown University, Box 1910, 02912-1910, Providence, RI</wicri:regionArea></affiliation></author><author><name sortKey="Shvartsman, A" sort="Shvartsman, A" uniqKey="Shvartsman A" first="A." last="Shvartsman">A. Shvartsman</name><affiliation wicri:level="1"><mods:affiliation>Digital Equipment Corporation, 30 Porter Road LJ02/I11, 01460-1446, Littleton, MA, USA</mods:affiliation><country xml:lang="fr">États-Unis</country><wicri:regionArea>Digital Equipment Corporation, 30 Porter Road LJ02/I11, 01460-1446, Littleton, MA</wicri:regionArea></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:3F895B5160720CA1BEFBA8BFEFF2E09A0E94B396</idno><date when="1994" year="1994">1994</date><idno type="doi">10.1007/BFb0015013</idno><idno type="url">https://api.istex.fr/document/3F895B5160720CA1BEFBA8BFEFF2E09A0E94B396/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001511</idno><idno type="wicri:Area/Istex/Curation">001424</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Efficient parallelism vs reliable distribution: A trade-off for concurrent computations</title><author><name sortKey="Kanellakis, C" sort="Kanellakis, C" uniqKey="Kanellakis C" first="C." last="Kanellakis">C. Kanellakis</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, Brown University, Box 1910, 02912-1910, Providence, RI, USA</mods:affiliation><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, Brown University, Box 1910, 02912-1910, Providence, RI</wicri:regionArea></affiliation></author><author><name sortKey="Michailidis, Dimitrios" sort="Michailidis, Dimitrios" uniqKey="Michailidis D" first="Dimitrios" last="Michailidis">Dimitrios Michailidis</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, Brown University, Box 1910, 02912-1910, Providence, RI, USA</mods:affiliation><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, Brown University, Box 1910, 02912-1910, Providence, RI</wicri:regionArea></affiliation></author><author><name sortKey="Shvartsman, A" sort="Shvartsman, A" uniqKey="Shvartsman A" first="A." last="Shvartsman">A. Shvartsman</name><affiliation wicri:level="1"><mods:affiliation>Digital Equipment Corporation, 30 Porter Road LJ02/I11, 01460-1446, Littleton, MA, USA</mods:affiliation><country xml:lang="fr">États-Unis</country><wicri:regionArea>Digital Equipment Corporation, 30 Porter Road LJ02/I11, 01460-1446, Littleton, MA</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1994</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">3F895B5160720CA1BEFBA8BFEFF2E09A0E94B396</idno><idno type="DOI">10.1007/BFb0015013</idno><idno type="ChapterID">21</idno><idno type="ChapterID">Chap21</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Concurrent computations should combine efficiency with reliability, where efficiency is usually associated with parallel and reliability with distributed computing. Such a desirable combination is not always possible, because of an intuitive trade-off: 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-offs in efficiency. We illustrate a number of cases where optimal trade-offs 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.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001424 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 001424 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:3F895B5160720CA1BEFBA8BFEFF2E09A0E94B396
|texte= Efficient parallelism vs reliable distribution: A trade-off for concurrent computations
}}
| This area was generated with Dilib version V0.6.32. |  |