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...
175
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...
160
click to vote
SPAA
15 years 11 months ago
2004 ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
161
click to vote
SPAA
15 years 11 months ago
2004 ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
133
click to vote
SPAA
15 years 11 months ago
2004 ACM 
Despite years of research, the design of efficient nonblocking algorithms remains difficult. A key reason is that current shared-memory multiprocessor architectures support only s...
|
Distributed And Parallel Computing