Sciweavers

SPAA
2000
ACM
15 years 9 months 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. ...
126
Voted
SPAA
2000
ACM
15 years 9 months ago
Data management in hierarchical bus networks
Friedhelm Meyer auf der Heide, Harald Räcke, ...
101
Voted
SPAA
2000
ACM
15 years 9 months 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...
99
Voted
SPAA
2000
ACM
15 years 9 months ago
The data locality of work stealing
Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe
141
Voted
PODC
2000
ACM
15 years 9 months 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
15 years 9 months 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
15 years 9 months ago
X-ability: a theory of replication
Svend Frølund, Rachid Guerraoui
113
Voted
PODC
2000
ACM
15 years 9 months ago
Achieving scalability and expressiveness in an Internet-scale event notification service
Antonio Carzaniga, David S. Rosenblum, Alexander L...