Sciweavers

115
Voted
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
15 years 5 months ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
15 years 5 months ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider
WDAG
1995
Springer
100views Algorithms» more  WDAG 1995»
15 years 5 months ago
Universal Constructions for Large Objects
We present lock-free and wait-free universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object...
James H. Anderson, Mark Moir
WDAG
1995
Springer
103views Algorithms» more  WDAG 1995»
15 years 5 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...
Algorithms
Top of PageReset Settings