SPAA 2004 - PDF Preprint Papers

SPAA 2004 ACM Symposium on Parallel Algorithms and Architectures

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SPAA-2004 Paper

click to vote

SPAA
2004
ACM

250views Distributed And Parallel Com...» more SPAA 2004»

Balanced graph partitioning

13 years 9 months ago

Download www.dcs.warwick.ac.uk

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...

Konstantin Andreev, Harald Räcke

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	250	Balanced graph partitioning	claim
2	189	On achieving optimized capacity utilization in application overlay networks with multiple competing sessions	claim
3	153	Cache-oblivious shortest paths in graphs using buffer heap	claim
4	149	Online algorithms for prefetching and caching on parallel disks	claim
5	125	DCAS is not a silver bullet for nonblocking algorithm design	claim
6	124	Lower bounds for graph embeddings and combinatorial preconditioners	claim
7	117	A scalable lock-free stack algorithm	claim
8	117	The potential in energy efficiency of a speculative chip-multiprocessor	claim
9	111	Fighting against two adversaries: page migration in dynamic networks	claim
10	111	Parallelism versus memory allocation in pipelined router forwarding engines	claim
11	109	Online hierarchical cooperative caching	claim
12	108	Adaptive channel queue routing on k-ary n-cubes	claim
13	102	On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs	claim
14	98	Online algorithms for network design	claim
15	94	Bi-criteria algorithm for scheduling jobs on cluster platforms	claim
16	91	Improved combination of online algorithms for acceptance and rejection	claim
17	88	Sharing the cost of multicast transmissions in wireless networks	claim
18	86	Dynamic analysis of the arrow distributed protocol	claim
19	85	Effectively sharing a cache among threads	claim
20	84	Object location in realistic networks	claim
21	84	Writing-all deterministically and optimally using a non-trivial number of asynchronous processors	claim
22	79	Compact name-independent routing with minimum stretch	claim
23	78	Pagoda: a dynamic overlay network for routing, data management, and multicasting	claim
24	74	New results on web caching with request reordering	claim
25	73	The effect of faults on network expansion	claim
26	70	Packet-mode policies for input-queued switches	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers