A low-cost processor group membership protocol for a hard real-time distributed system

Clegg, Matthew; Marzullo, Keith

doi:10.1109/real.1997.641272

Cited by 5 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To provide this service, one must solve two orthogonal problems: 1) determining the set of processes that appear to be up in the system, and 2) agreeing on each successive view of this dynamically changing set. 9 We consider the above service to be just one possible application of our GMS. In fact, to implement this service, an application can use one of our GMS variants together with some failure detector D that gives (reliable or unreliable) information about which processes have crashed.…”

Section: Group Membership and Agreeing On The Set Of Operational Procmentioning

confidence: 99%

From Set Membership to Group Membership: A Separation of Concerns

Schiper

Toueg

2006

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

We revisit the well-known group membership problem and show how it can be considered a special case of a simple problem, the set membership problem. In the set membership problem, processes maintain a set whose elements are drawn from an arbitrary universe: They can request the addition or removal of elements to/from that set, and they agree on the current value of the set. Group membership corresponds to the special case where the elements of the set happen to be processes. We exploit this new way of looking at group membership to give a simple and succint specification of this problem and to outline a simple implementation approach based on the state machine paradigm. This treatment of group membership separates several issues that are often mixed in existing specifications and/or implementations of group membership. We believe that this separation of concerns greatly simplifies the understanding of this problem.

show abstract

Section: Group Membership and Agreeing On The Set Of Operational Procmentioning

confidence: 99%

From Set Membership to Group Membership: A Separation of Concerns

Schiper

Toueg

2006

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

show abstract

“…A problem closely related to distributed diagnosis, known as the synchronous group membership problem [6], [7], [11], [12], [15], is for each working node to maintain correct information about the group of working nodes with which it can communicate, and for all nodes in one group to agree on the membership of the group. In [12], it is shown that, under some models, these two problems are equivalent and an algorithm for one problem can be converted to an algorithm for the other.…”

Section: Related Workmentioning

confidence: 99%

“…Our work is closest to the approach taken in [6], where there is no limit on how many nodes can change state during execution of the algorithm, but there is a limit on how frequently an individual node can change state. The algorithm of [6] guarantees that working nodes make identical membership changes at the same local clock times.…”

Section: Related Workmentioning

confidence: 99%

“…The algorithm of [6] guarantees that working nodes make identical membership changes at the same local clock times. To achieve this strong property, the algorithm requires synchronized clocks and a form of atomic broadcast.…”

Section: Related Workmentioning

confidence: 99%

“…Bounded correctness can be achieved without clock synchronization and does not require any special communication mechanisms. In addition, the work of [6] does not derive lower bounds on state holding time and latency and, therefore, does not address the limits of dynamic behavior nor the optimality of the presented algorithm.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Distributed diagnosis in dynamic fault environments

Subbiah

Blough

2004

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-The problem of distributed diagnosis in the presence of dynamic failures and repairs is considered. To address this problem, the notion of bounded correctness is defined. Bounded correctness is made up of three properties: bounded diagnostic latency, which ensures that information about state changes of nodes in the system reaches working nodes with a bounded delay, bounded start-up time, which guarantees that working nodes determine valid states for every other node in the system within bounded time after their recovery, and accuracy, which ensures that no spurious events are recorded by working nodes. It is shown that, in order to achieve bounded correctness, the rate at which nodes fail and are repaired must be limited. This requirement is quantified by defining a minimum state holding time in the system. Algorithm HeartbeatComplete is presented and it is proven that this algorithm achieves bounded correctness in fully-connected systems while simultaneously minimizing diagnostic latency, start-up time, and state holding time. A diagnosis algorithm for arbitrary topologies, known as Algorithm ForwardHeartbeat, is also presented. ForwardHeartbeat is shown to produce significantly shorter latency and state holding time than prior algorithms, which focused primarily on minimizing the number of tests at the expense of latency.

show abstract