Initial failures in distributed computations

Gadi Taubenfeld; Shmuel Katz; Shlomo Moran

doi:10.1007/BF01407859

Initial failures in distributed computations

Gadi Taubenfeld, Shmuel Katz, Shlomo Moran

Research output: Contribution to journal › Article › peer-review

Abstract

We investigate the possibility of solving problems in completely asynchronous message passing systems where a number of processes may fail prior to execution. By using game-theoretical notions, necessary and sufficient conditions are provided for solving problems is such a model with an without a termination requirement. An upper bound on the message complexity for solving any problem in the model is given, as well as a simple design concept for constructing a solution to any solvable problem.

Original language	English
Pages (from-to)	255-276
Number of pages	22
Journal	International Journal of Parallel Programming
Volume	18
Issue number	4
DOIs	https://doi.org/10.1007/BF01407859
State	Published - Aug 1989
Externally published	Yes

Keywords

Asynchronous protocols
crash failures
initial failures
winning strategy

Access to Document

10.1007/BF01407859

Cite this

@article{b59b1968b1ff430f9a674065f236d4ce,

title = "Initial failures in distributed computations",

abstract = "We investigate the possibility of solving problems in completely asynchronous message passing systems where a number of processes may fail prior to execution. By using game-theoretical notions, necessary and sufficient conditions are provided for solving problems is such a model with an without a termination requirement. An upper bound on the message complexity for solving any problem in the model is given, as well as a simple design concept for constructing a solution to any solvable problem.",

keywords = "Asynchronous protocols, crash failures, initial failures, winning strategy",

author = "Gadi Taubenfeld and Shmuel Katz and Shlomo Moran",

year = "1989",

month = aug,

doi = "10.1007/BF01407859",

language = "אנגלית",

volume = "18",

pages = "255--276",

journal = "International Journal of Parallel Programming",

issn = "0885-7458",

publisher = "Springer New York",

number = "4",

}

TY - JOUR

T1 - Initial failures in distributed computations

AU - Taubenfeld, Gadi

AU - Katz, Shmuel

AU - Moran, Shlomo

PY - 1989/8

Y1 - 1989/8

N2 - We investigate the possibility of solving problems in completely asynchronous message passing systems where a number of processes may fail prior to execution. By using game-theoretical notions, necessary and sufficient conditions are provided for solving problems is such a model with an without a termination requirement. An upper bound on the message complexity for solving any problem in the model is given, as well as a simple design concept for constructing a solution to any solvable problem.

AB - We investigate the possibility of solving problems in completely asynchronous message passing systems where a number of processes may fail prior to execution. By using game-theoretical notions, necessary and sufficient conditions are provided for solving problems is such a model with an without a termination requirement. An upper bound on the message complexity for solving any problem in the model is given, as well as a simple design concept for constructing a solution to any solvable problem.

KW - Asynchronous protocols

KW - crash failures

KW - initial failures

KW - winning strategy

UR - https://www.scopus.com/pages/publications/0024717247

U2 - 10.1007/BF01407859

DO - 10.1007/BF01407859

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0024717247

SN - 0885-7458

VL - 18

SP - 255

EP - 276

JO - International Journal of Parallel Programming

JF - International Journal of Parallel Programming

IS - 4

ER -

Initial failures in distributed computations

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this