Process of Membership in Asynchronous Environments
Author(s) -
Aleta Ricciardi,
Kenneth P. Birman
Publication year - 1993
Publication title -
ecommons (cornell university)
Language(s) - English
Resource type - Reports
DOI - 10.21236/ada264399
Subject(s) - correctness , asynchronous communication , computer science , emulation , distributed computing , protocol (science) , mathematical proof , process (computing) , software , software engineering , programming language , computer network , mathematics , medicine , alternative medicine , geometry , pathology , economics , economic growth
: The development of reliable distributed software is simplified by the ability to assume a fail-stop failure model. We discuss the emulation of such a model in an asynchronous distributed environment. The solution we propose, called Strong-GMP, can be supported through a highly efficient protocol, and has been implemented as part of a distributed systems software project at Cornell University. Here, we focus on the precise definition of the problem, the protocol, correctness proofs, and an analysis of costs. Asynchronous computation, Fault detection, Process membership, Fault tolerance, Process group.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom