Sciweavers

OPODIS
2000
13 years 5 months ago
Fair and Reliable Self-stabilizing Communication
We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The paper present...
Ivan Lavallée, Christian Lavault, Colette J...
WDAG
1995
Springer
103views Algorithms» more  WDAG 1995»
13 years 8 months ago
Self-Stabilization of Wait-Free Shared Memory Objects
This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every executio...
Jaap-Henk Hoepman, Marina Papatriantafilou, Philip...