Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 1, 1999 | public
Report Open

A Possible Solution to the Impossible Membership Problem

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.

Files

etr032.pdf
Files (3.0 MB)
Name Size Download all
md5:5ac6a9d0cd324199a58462f0de225b5c
291.8 kB Download
md5:dc8d79774319a3968345a8136ac3f8aa
2.7 MB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023