A parallelisable multi-level banded diffusion scheme for computing balanced partitions with smooth boundaries

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

Volumn 4641 LNCS, Issue , 2007, Pages 195-204

  Pellegrini, François ^a  

^a Ecole Nationale Superieure d'Electronique Informatique et Radiocommunications de Bordeaux   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING;

DIFFUSION ALGORITHMS; OPTIMIZATION ALGORITHMS; SMOOTH BOUNDARIES;

GRAPH THEORY;

EID: 38049150487     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74466-5_22     Document Type: Conference Paper

References (13)

1. Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proceedings of Supercomputing (1995)
2. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. on Scientific Computing 20(1), 359-392 (1998)
3. Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitionning graphs. BELL System Technical Journal 49, 291-307 (1970)
4. Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proc. 19th Design Automat. Conf. pp. 175-181. IEEE Computer Society Press, Los Alamitos (1982)
5. Vanderstraeten, R., Keunings, R., Farhat, C.: Beyond conventional mesh partitioning algorithms. In: SIAM Conf. on Par. Proc. pp. 611-614 (1995)
6. Diekmann, R., Preis, R., Schlimbach, F., Walshaw, C.: Aspect ratio for mesh partitioning. In: Pritchard, D., Reeve, J.S. (eds.) Euro-Par 1998. LNCS, vol. 1470, pp. 347-351. Springer, Heidelberg (1998)
7. Meyerhenke, H., Schamberger, S.: Balancing parallel adaptive FEM computations by solving systems of linear equations. In: Cunha, J.C., Medeiros, P.D. (eds.) EuroPar 2005. LNCS, vol. 3648, pp. 209-219. Springer, Heidelberg (2005)
8. Meyerhenke, H., Schamberger, S.: A parallel shape optimizing load balancer. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par 2006. LNCS, vol. 4128, pp. 232-242. Springer, Heidelberg (2006)
9. Wan, Y., Roy, S., Saberi, A., Lesieutre, B.: A stochastic automaton-based algorithm for flexible and distributed network partitioning. In: Proc. Swarm Intelligence Symposium, pp. 273-280. IEEE, Los Alamitos (2005)
10. Chevalier, C., Pellegrini, F.: Improvement of the efficiency of genetic algorithms for scalable parallel graph partitioning in a multi-level framework. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par 2006. LNCS, vol. 4128, pp. 243-252. Springer, Heidelberg (2006) http://www.labri.fr/~pelegrin/papers/ scotch_efficientga.pdf
11. Chevalier, C., Pellegrini, F.: PT- SCOTCH: A tool for efficient parallel graph ordering. Parallel Computing (submitted), http://www.labri.fr/~pelegrin/ papers/scotch_parallelordering_parcomp.pdf
12. SCOTCH: Static mapping, graph partitioning, and sparse matrix block ordering package, http://www.labri.fr/~pelegrin/scotch/
13. Simon, H.D., Teng, S.H.: How good is recursive bipartition. SIAM J. Scientific Computing 18(5), 1436-1445 (1997)