A local refinement algorithm for data partitioning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1947, Issue , 2001, Pages 140-148

  Rantakokko, Jarmo ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

ARITHMETIC COMPLEXITY; DATA PARTITIONING; DYNAMIC PROBLEM; EDGE CUTS; LOCAL REFINEMENT; MULTI-LEVEL PARTITIONING; NEAR-OPTIMAL; PARTITIONING METHODS;

DATA HANDLING;

EID: 84888753806     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70734-4     Document Type: Conference Paper

References (11)

1. C.M. Fiduccia, R.M. Mattheyses, A Linear-Time Heuristic for Improving Network Partitions, in Proceedings of 19th IEEE Design Automation Conference, IEEE, pp. 175-181, 1982.
2. B. Hendrickson, R. Leland,A Multidimensional Spectral Load Balancing, Technical Report SAND 93-0074, Sandia National Laboratories, Albuquerque, NM, 1993.
3. B. Hendrickson, R. Leland, A Multilevel Algorithm for Partitioning Graphs, in Proceedings of Supercomputing '95, 1995.
4. B. Hendrickson, R. Leland, The Chaco User's Guide Version 2.0, Technical Report, Sandia National Laboratories, Albuquerque, NM, July 1995.
5. G. Karypis, V. Kumar, Multilevel k-way Partitioning Scheme for Irregular Graphs, Technical Report, University of Minnesota, Department of Computer Science, Minneapolis, 1996.
6. G. Karypis, V. Kumar, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, Technical Report, University of Minnesota, Department of Computer Science, Minneapolis, 1995.
7. G. Karypis, V. Kumar, Metis: Unstructured Graph Partitioning and Sparse Matrix Ordering System, Technical Report, University of Minnesota, Department of Computer Science, Minneapolis, 1995.
8. J. Rantakokko, A framework for partitioning structured grids with inhomogeneous workload, Parallel Algorithms and Applications, Vol 13, pp:135-151, 1998.
9. J. Rantakokko, Comparison of partitioning strategies for PDE solvers on multiblock grids, in Proceedings of PARA’98, B. Kagstrom, J. Dongarra, E. Elmroth and J. Wasniewski (editors). Applied Parallel Computing, 4th International Workshop, PARA’98, Lecture Notes in Computer Science, No. 1541, Springer-Verlag, Berlin, 1998.
10. J. Rantakokko, Partitioning Strategies for Structured Multiblock Grids, accepted for publication in Parallel Computing, special issue on Graph Partitioning and Parallel Computing.
11. C. Walshaw, M. Cross, M.G. Everett, A Localised Algorithm for Optimising Unstructured Mesh Partitions, International Journal of Supercomputer Applications 9(4):280-295, 1995.