23 search results - page 3 / 5 » jpdc 2010 |
JPDC
2010
13 years 9 months ago
2010
JPDC
2010
13 years 5 months ago
2010
JPDC
2010
13 years 5 months ago
2010
We present an efficient parallel algorithm for building the separating tree for a separable permutation. Our algorithm runs in O(log2 n) time using O(n log n) operations on the CR...
JPDC
2010
13 years 9 months ago
2010
Topology maintenance, or how to handle the possibly concurrent joining and leaving of nodes, is a central problem for structured peer-to-peer networks. A good topology maintenance...
JPDC
2010
13 years 5 months ago
2010
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...