200
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...
191
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...
190
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...
184
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...
182
click to vote
SPAA
15 years 11 months ago
2004 ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
|
Distributed And Parallel Computing