193
click to vote
SPAA
15 years 11 months ago
2004 ACM 
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
180
click to vote
SPAA
15 years 11 months ago
2004 ACM 
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
177
click to vote
SPAA
15 years 11 months ago
2004 ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
174
click to vote
SPAA
15 years 11 months ago
2004 ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
174
click to vote
SPAA
15 years 11 months ago
2004 ACM
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...
|
Distributed And Parallel Computing