Sciweavers

3 search results - page 1 / 1
» Self-Stabilization of Wait-Free Shared Memory Objects
Sort
View
WDAG
1995
Springer
103views Algorithms» more  WDAG 1995»
13 years 7 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...
PODC
1991
ACM
13 years 7 months ago
Randomized Wait-Free Concurrent Objects (Extended Abstract)
d abstract) Maurice Herlihy Digital Equipment Corporation Cambridge Research Laboratory One Kendall Square Cambridge MA, 02139 Digital Equipment Corporation Cambridge Research Lab ...
Maurice Herlihy
SPAA
1990
ACM
13 years 8 months ago
Wait-Free Data Structures in the Asynchronous PRAM Model
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
James Aspnes, Maurice Herlihy