A self-stabilizing quorum-based protocol for maxima computing

Authors:
Yiwei Chiao;Masaaki Mizuno;Mitchell L. Neilsen
Affiliations:
Department of Computing and Information Sciences, 234 Nichols Hall, Kansas State University, Manhattan, KS;Department of Computing and Information Sciences, 234 Nichols Hall, Kansas State University, Manhattan, KS;Department of Computing and Information Sciences, 234 Nichols Hall, Kansas State University, Manhattan, KS
Venue:
Distributed Computing
Year:
2002

Citing 7
Cited 1

How to assign votes in a distributed system

Journal of the ACM (JACM)
A N algorithm for mutual exclusion in decentralized systems

ACM Transactions on Computer Systems (TOCS)
A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments

Information Processing Letters
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Coterie Join Algorithm

IEEE Transactions on Parallel and Distributed Systems
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments

WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Self-stabilization of dynamic systems assuming only read/write atomicity

Distributed Computing - Special issue: Self-stabilization

Transformations for write-all-with-collision model

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of decentralized consensus protocols is to exchange information among nodes so that each node acquires the information held by every other node in the system. This paper presents a quorum-based, self-stabilizing maxima finding protocol which is based on a decentralized consensus protocol. The protocol exchanges information with less delay than existing ring-based, self-stablizing protocols. Furthermore, quorums can be composed, and the resulting composite quorums can be used to efficiently obtain a solution for any internetwork.