SPAA
2005
ACM
14 years 10 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 10 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 10 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...
SPAA
2005
ACM
14 years 10 months ago
2005
ACM
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees. Our ...
SPAA
2005
ACM
14 years 10 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
SPAA
2005
ACM
14 years 10 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
SPAA
2005
ACM
14 years 10 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
SPAA
2005
ACM
14 years 10 months ago
2005
ACM
SPAA
2005
ACM
14 years 10 months ago
2005
ACM
SPAA
2005
ACM
14 years 10 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...