Graph partitioning in scientific simulations: Multilevel schemes versus space-filling curves

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

Volumn 2763, Issue , 2003, Pages 165-179

  Schamberger, Stefan ^a   Wierum, Jens Michael ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b Paderborn Center for Parallel Computing   (Germany)

Author keywords

FEM graph partitioning; Space filling curves

Indexed keywords

FILLING;

COMPUTATION NODES; DISTRIBUTING-LOAD; FINITE ELEMENT MESHES; GEOMETRIC APPROACHES; GRAPH PARTITIONING; MULTILEVEL SCHEMES; SCIENTIFIC SIMULATIONS; SPACE-FILLING CURVE;

GRAPH THEORY;

EID: 26844472733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45145-7_14     Document Type: Article

References (21)

1. G. Fox, R. Williams, and P. Messina. Parallel Computing Works! Morgan Kaufmann, San Francisco, 1994.
2. Bruce Hendrickson and Karen Devine. Dynamic load balancing in computational mechanics. Computer Methods in Applied Mechanics and Engineering, 184:485-500, 2000.
3. K. Schloegel, G. Karypis, and V. Kumar. Graph partitioning for high performance scientific simulations. In J. Dongarra et al., editor, The Sourcebook of Parallel Computing. Morgan Kaufmann, 2002. to appear.
4. George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359-392, 1998.
5. C. Walshaw and M. Cross. Mesh partitioning: A multilevel balancing and refinement algorithm. SIJSSC: SIAM Journal on Scientific and Statistical Computing, apparently renamed SIAM Journal on Scientific Computing, 22, 2000.
6. B. Hendrickson and R. Leland. The chaco user's guide - version 2.0, 1994.
7. R. Preis and R. Diekmann. Party - a software library for graph partitioning. Advances in Computational Mechanics with Parallel and Distributed Processing, pages 63-71, 1997.
8. Robert Preis. The PARTY graphpartitioning-library - user manual - version 1.99.
9. C. M. Fiduccia and R. M. Mattheyses. A linear time heuristic for improving network partitions. In Design Automation Conference, May 1984.
10. B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, February 1970.
11. R. Diekmann, B. Monien, and R. Preis. Using helpful sets to improve graph bi-sections. In Interconnection Networks and Mapping and Scheduling Parallel Computations, volume 21 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 57-73. AMS Publications, 1995.
12. David Hilbert. Über die stetige Abbildung einer Linie auf ein Flächenstück. Mathematische Annalen, 38:459-460, 1891.
13. H. Sagan. Space Filling Curves. Springer, 1994.
14. Jens-Michael Wierum. Definition of a new circular space-filling curve - βΩ-indexing. Technical Report TR-001-02, Paderborn Center for Parallel Computing, http://www.upb.de/pc2/, 2002.
15. Jochen Alber and Rolf Niedermeier. On multi-dimensional hilbert indexings. In Computing and Combinatorics, number 1449 in LNCS, pages 329-338, 1998.
16. Gerhard Zumbusch. On the quality of space-filling curve induced partitions. Zeitschrift für Angewandte Mathematik und Mechanik, 81, SUPP/1:25-28, 2001.
17. Gerhard Zumbusch. Load balancing for adaptivly refined grids. Technical Report 722, SFB 256, University Bonn, 2001.
18. Jan Hungershöfer and Jens-Michael Wierum. On the quality of partitions based on space-filling curves. In International Conference on Computational Science ICCS, volume 2331 of LNCS, pages 36-45. Springer, 2002.
19. Bruce Hendrickson and Tamara G. Kolda. Graph partitioning models for parallel computing. Parallel Computing, 26(12):1519-1534, 2000.
20. C. Walshaw. The graph partitioning archive. http://www.gre.ac.uk/c.walshaw/partition/.
21. R. Battiti and A. Bertossi. Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Transactions on Computers, 48(4):361-385, April 1999.