CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A Membership Agreement Algorithm Detecting and Tolerating Asymmetric Timing Faults

Håkan Sivencrona ; Mattias Persson (Institutionen för datorteknik) ; Jan Torin (Institutionen för datorteknik)
Working Conference on Distributed and Parallel Embedded Systems (DIPES 2004) held at the 18th World Computer Congress, Toulouse, FRANCE. AUG 22-27, 2004 (2004)
[Konferensbidrag, refereegranskat]

Our paper presents a new membership agreement algorithm that address asymmetric timing faults and includes a new tool simulating TTP/C clusters. The proposed algorithm flags deviating or slightly untimely messages to assure that single marginal transmitting faults are detected and that only the faulty node will be expelled. The tool can demonstrate the behavior of membership agreement algorithms such as the original TTP-C1 algorithm or our modified flagging algorithm. The performed simulations use experimental results from heavy-ion fault injection logged timing faults. The gathered results show the rare faults, which made a network using the original algorithm either collapse or become degraded, are detected and handled with the new algorithm without loss of more than the faulty node.

Nyckelord: membership agreement; asymmetric timing faults; fault detection

Denna post skapades 2013-06-19.
CPL Pubid: 178878


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datorteknik (2002-2004)


Data- och informationsvetenskap

Chalmers infrastruktur