Sciweavers

SPAA
2000
ACM
14 years 4 days ago
An experimental study of a simple, distributed edge coloring algorithm
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
Madhav V. Marathe, Alessandro Panconesi, Larry D. ...
SPAA
2000
ACM
14 years 4 days ago
Data management in hierarchical bus networks
Friedhelm Meyer auf der Heide, Harald Räcke, ...
SPAA
2000
ACM
14 years 4 days ago
DCAS-based concurrent deques
The computer industry is currently examining the use of strong synchronization operations such as double compareand-swap (DCAS) as a means of supporting non-blocking synchronizati...
Ole Agesen, David Detlefs, Christine H. Flood, Ale...
SPAA
2000
ACM
14 years 4 days ago
The data locality of work stealing
Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe
PODC
2000
ACM
14 years 5 days ago
Garbage collection of timestamped data in Stampede
Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of...
Rishiyur S. Nikhil, Umakishore Ramachandran
PODC
2000
ACM
14 years 5 days ago
Debugging distributed programs using controlled re-execution
Distributed programs are hard to write. A distributed debugger equipped with the mechanism to re-execute the traced computation in a controlled fashion can greatly facilitate the ...
Neeraj Mittal, Vijay K. Garg
PODC
2000
ACM
14 years 5 days ago
X-ability: a theory of replication
Svend Frølund, Rachid Guerraoui