SPAA
2005
ACM
14 years 1 months ago
2005
ACM
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...