Easily rendering token-ring algorithms of distributed and parallel applications fault tolerant - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Easily rendering token-ring algorithms of distributed and parallel applications fault tolerant

Résumé

We propose in this paper a new algorithm that, when called by existing token ring-based algorithms of parallel and distributed applications, easily renders the token tolerant to losses in presence of node crashes. At most k consecutive node crashes are tolerated in the ring. Our algorithm scales very well since a node monitors the liveness of at most k other nodes and neither a global election algorithm nor broadcast primitives are used to regenerate a new token. It is thus very effective in terms of latency cost. Finally, a study of the probability of having at most k consecutive node crashes in the presence of f failures and a discussion of how to extend our algorithm to other logical topologies are also presented.

Dates et versions

hal-01216412 , version 1 (16-10-2015)

Identifiants

Citer

Luciana Arantes, Julien Sopena. Easily rendering token-ring algorithms of distributed and parallel applications fault tolerant. 25th International Symposium on Computer Architecture and High Performance Computing (SBAC'13), Oct 2013, Porto de Galinhas, Brazil. pp.206-213, ⟨10.1109/SBAC-PAD.2013.11⟩. ⟨hal-01216412⟩
42 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More