A Possible Solution to the Impossible Membership Problem

Franceschetti, M. and Bruck, J. (1999) A Possible Solution to the Impossible Membership Problem. Technical Report. California Institute of Technology. [CaltechPARADISE:1999.ETR032]

Full text available as:

	PDF (Adobe PDF (2.7MB)) - Requires Adobe Acrobat Reader or other PDF viewer.
	Postscript - Requires a viewer, such as GhostView

Abstract

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.

EPrint Type:	Monograph (Technical Report)
Additional Information:	[Alternate URL: http://www.paradise.caltech.edu/papers/etr032.ps]
Subjects:	All Records
ID Code:	17
Deposited By:	Jehoshua Bruck
Deposited On:	03 September 2002
Record Number:	CaltechPARADISE:1999.ETR032
Official Persistent URL:	http://resolver.caltech.edu/CaltechPARADISE:1999.ETR032
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record