A fault-tolerant protocol for election in chordal-ring networks with fail-stop processor failures

1997 ◽  
Vol 46 (1) ◽  
pp. 11-17 ◽  
Author(s):  
Yi Pan ◽  
G. Singh
Networks ◽  
2000 ◽  
Vol 36 (3) ◽  
pp. 180-190 ◽  
Author(s):  
Lali Barri�re ◽  
Josep F�brega ◽  
Ester Sim� ◽  
Marisa Zaragoz�

Author(s):  
HIROSHI MASUYAMA ◽  
ETSUKO MASUYAMA

A family of regular graphs of degree 3, called chordal rings is presented as a possible candidate for the implementation of a distributed system and for fault-tolerant architectures. The symmetry of graphs makes it possible to determine message routing by using a simple distributed algorithm. Arbitrary data permutations are generally accomplished by sorting. For certain classes of permutations, however, there exist algorithms that are more efficient than the best sorting algorithm. One such class is the Bit Permute Complement (BPC) class of permutations. In this paper, we first develop algorithms requiring two token storage registers in each node to realize an arbitrary BPC permutation. We next evaluate its ability to realize BPC permutations in networks of arbitrary size by estimating the number of required routing steps when a single fault is present and when not.


1990 ◽  
Vol 137 (4) ◽  
pp. 310 ◽  
Author(s):  
R.F. Browne ◽  
R.M. Hodgson
Keyword(s):  

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 80427-80436
Author(s):  
Fawaz E. Alsaadi ◽  
Muhammad Salman ◽  
Faisal Ali ◽  
Imran Khalid ◽  
Jinde Cao ◽  
...  

Algorithmica ◽  
1989 ◽  
Vol 4 (1-4) ◽  
pp. 437-446 ◽  
Author(s):  
Hagit Attiya ◽  
Jan van Leeuwen ◽  
Nicola Santoro ◽  
Shmuel Zaks
Keyword(s):  

2004 ◽  
Vol 27 (2-4) ◽  
pp. 133-149 ◽  
Author(s):  
Joel J.P.C. Rodrigues ◽  
Mário M. Freire ◽  
Pascal Lorenz

Sign in / Sign up

Export Citation Format

Share Document