A Caltech Library Service

A Possible Solution to the Impossible Membership Problem

Franceschetti, Massimo and Bruck, Jehoshua (1999) A Possible Solution to the Impossible Membership Problem. California Institute of Technology . (Unpublished)

PDF (Adobe PDF (2.7MB))
See Usage Policy.

See Usage Policy.


Use this Persistent URL to link to this item:


This paper presents a solvable specification and gives an algorithm for the Group Membership Problem in asynchronous systems with crash failures. Our specification requires processes to maintain a consistent history in their sequence of views. This allows processes to order failures and recoveries in time and simplifies the programming of high level applications. Previous work proved that the Group Membership Problem cannot be solved in asynchronous systems with crash failures. We circumvent this impossibility result building a weaker, yet non-trivial specification. We show that our solution is an improvement upon previous attempts to solve this problem using a weaker specification. We also relate our solution to other methods, and give a classification of progress properties that can be achieved under different models.

Item Type:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription
Bruck, Jehoshua0000-0001-8474-0812
Group:Parallel and Distributed Systems Group
Record Number:CaltechPARADISE:1999.ETR032
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26042
Deposited By: Imported from CaltechPARADISE
Deposited On:03 Sep 2002
Last Modified:22 Nov 2019 09:58

Repository Staff Only: item control page