161
click to vote
SPAA
15 years 8 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...
144
click to vote
SPAA
15 years 8 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...
142
click to vote
SPAA
15 years 8 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...
142
click to vote
SPAA
15 years 8 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...
137
click to vote
SPAA
15 years 8 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...
|
Distributed And Parallel Computing