Sciweavers

6 search results - page 1 / 2
» wdag 1995
Sort
View
159
Voted
WDAG
1995
Springer
82views Algorithms» more  WDAG 1995»
15 years 10 months ago
On Real-Time and Non Real-Time Distributed Computing
Gérard Le Lann
121
Voted
WDAG
1995
Springer
84views Algorithms» more  WDAG 1995»
15 years 10 months ago
Multi-Dimensional Interval Routing Schemes
Michele Flammini, Giorgio Gambosi, Umberto Nanni, ...
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
15 years 10 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
145
Voted
WDAG
1995
Springer
100views Algorithms» more  WDAG 1995»
15 years 10 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
169
Voted
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
15 years 10 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