Loading...
Please wait, while we are loading the content...
Similar Documents
A possible solution to the impossible membership problem (1999).
| Content Provider | CiteSeerX |
|---|---|
| Author | Franceschetti, Massimo Bruck, Jehoshua |
| Abstract | This paper constructs a solvable specication and gives an algorithm for the Group Membership Problem in asynchronous systems with crash failures. Our specication requires processes to maintain a consistent history in their sequence of views. This allows to order failures and recoveries in time and simplies the programming of many high level applications. Previous work proved that the Group Membership Problem cannot be solved in asynchronous systems with crash failures. We identify the main assumptions required for this proof and show how to circumvent this impossibility result building a weaker, yet non trivial specication. We show that our solution is an improvement upon previous attempts to solve this problem using a weaker specication. We also relate our solution to other methods used to circumvent the impossibility result and give a classication of progress properties that can be achieved under dierent models. Keywords: distributed agreement algorithms, group memb... |
| File Format | |
| Publisher Date | 1999-01-01 |
| Access Restriction | Open |
| Subject Keyword | Impossible Membership Problem Possible Solution Asynchronous System Crash Failure Impossibility Result Order Failure Solvable Specication Group Memb Previous Work Group Membership Problem Progress Property Previous Attempt Dierent Model Group Membership Problem Cannot Agreement Algorithm Non Trivial Specication Main Assumption Many High Level Application Consistent History |
| Content Type | Text |
| Resource Type | Article |
