Gossip-style failure detection and distributed consensus for scalable heterogeneous clusters

Gossip-style failure detection and distributed consensus for scalable heterogeneous clusters (2001)

Cached

Download Links

[www.hcs.ufl.edu]

Other Repositories/Bibliography

DBLP

by Sridharan Ranganathan , Alan D. George , Robert W. Todd , Matthew C. Chidester

Venue:	Cluster Computing
Citations:	13 - 6 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Gossip-style failure detection and distributed consensus for scalable heterogeneous clusters	INFERENCE
AUTHOR NAME	Sridharan Ranganathan	SVM HeaderParse 0.2
AUTHOR AFFIL	High-performance Computing and Simulation (HCS) Research Laboratory; Department of Electrical and Computer Engineering, University of Florida	SVM HeaderParse 0.2
AUTHOR ADDR	P.O. Box 116200, Gainesville, FL 32611-6200	SVM HeaderParse 0.2
AUTHOR NAME	Alan D. George	SVM HeaderParse 0.2
AUTHOR AFFIL	High-performance Computing and Simulation (HCS) Research Laboratory; Department of Electrical and Computer Engineering, University of Florida	SVM HeaderParse 0.2
AUTHOR ADDR	P.O. Box 116200, Gainesville, FL 32611-6200	SVM HeaderParse 0.2
AUTHOR NAME	Robert W. Todd	SVM HeaderParse 0.2
AUTHOR AFFIL	High-performance Computing and Simulation (HCS) Research Laboratory; Department of Electrical and Computer Engineering, University of Florida	SVM HeaderParse 0.2
AUTHOR ADDR	P.O. Box 116200, Gainesville, FL 32611-6200	SVM HeaderParse 0.2
AUTHOR NAME	Matthew C. Chidester	SVM HeaderParse 0.2
AUTHOR AFFIL	High-performance Computing and Simulation (HCS) Research Laboratory; Department of Electrical and Computer Engineering, University of Florida	SVM HeaderParse 0.2
AUTHOR ADDR	P.O. Box 116200, Gainesville, FL 32611-6200	SVM HeaderParse 0.2
ABSTRACT	Abstract ⎯ Gossip protocols provide a means by which failures can be detected in large, distributed systems in an asynchronous manner without the limits associated with reliable multicasting for group communications. However, in order to be effective with application recovery and reconfiguration, these protocols require mechanisms by which failures can be detected with system-wide consensus in a scalable fashion. This paper presents three new gossipstyle protocols supported by a novel algorithm to achieve consensus in scalable, heterogeneous clusters. The roundrobin protocol improves on basic randomized gossiping by distributing gossip messages in a deterministic order that optimizes bandwidth consumption. Redundant gossiping is completely eliminated in the binary round-robin protocol, and the round-robin with sequence check protocol is a useful extension that yields efficient detection times without the need for system-specific optimization. The distributed consensus algorithm works with these gossip protocols to achieve agreement among the operable nodes in the cluster on the state of the system featuring either a flat or a layered design. The various protocols are simulated and evaluated in terms of consensus time and scalability using a high-fidelity, fault-injection model for distributed systems comprised of clusters of workstations connected by highperformance networks. Index Terms ⎯ Cluster computing, consensus, failure detection, fault tolerance, gossip protocol, Myrinet. 1	SVM HeaderParse 0.2
YEAR	2001	INFERENCE
VENUE	Cluster Computing	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	197--209	INFERENCE
VOLUME	4	INFERENCE
CITATIONS	18 found	ParsCit 1.0