A parallel variant of simulated annealing for optimizing mesh partitions on workstations

Advances in Engineering Software

Volumn 29, Issue 3-6, 1998, Pages 481-485

  Bouhmala, Noureddine ^a   Pahud, Michel ^b  

^a UNIVERSITY OF NEUCHÂTEL   (Switzerland)

^b EPFL   (Switzerland)

Author keywords

Graph partitioning; Multilevel partitioning algorithm; Parallel simulated annealing

Indexed keywords

GRAPH THEORY; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

MESH PARTITIONING; MULTILEVEL PARTITIONING;

SIMULATED ANNEALING;

EID: 0032041159     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0965-9978(98)00013-1     Document Type: Article

References (14)

1. Barnard S., Simon H. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency and Experience. 6(2):1994;101-117.
2. Hendrickson, B. and Leland, R., A Multilevel algorithm for partitioning graphs. Technical report, SAND93-1301, Sandia National Laboratories, 1993.
3. Karypis, G. and Kumar, V., A fast and high quality multilevel scheme for partitioning irregular graphs. TR95-035, Computer Science Department, University of Minnesota, Minneapolis, MN, 1995.
4. Vanderstraeten D., Keunings R. Optimized partitioning of unstructured computational grids. Int. J. Numer. Meth. Engng. 38:1995;433-450.
5. Walshaw C., Cross M., Everett M. A localised algorithm for optimizing unstructured partitions. Int J. Supercomput. Applic. 9(4):1995;280-295.
6. Barnard, S. and Simon, H., Parallel multilevel recursive spectral bisection. In Supercomputing 1995, 1995.
7. Barnard, S. and Simon, H., A parallel implementation of multilevel recursive spectral bisection for application to adaptive unstructured meshes. In Proc. Seventh SIAM Conf. on Parallel Processing for Scientific Computing, 1995, pp. 627-632.
8. Gilbert J., Zmijewski E. A parallel graph partitioning algorithm for a message-passing multiprocessor. J. Parallel Programming. 16:1987;498-513.
9. Karypis, G. and Kumar, V., Parallel multilevel k-way partitioning scheme for irregular graphs. In Supercomputing 1996, 1996.
10. Walshaw, C., Cross, M. and Everett, M., Mesh partitioning and load-balancing for distributed memory parallel systems. In Proceedings of Parallel and Distributed Computing for Computational Mechanics, Lochinver, Scotland, 1997.
11. Kirkpatrick S., Gelatt C., Vecci M. Optimization by simulated annealing. Science. 220(4598):1983;671-680.
12. Farhat C. A simple and efficient automatic domain decomposer. Comput. Struct. 28(5):1988;579-602.
13. Williams R. Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency and Experience. 3(5):1900;457-481.
14. Ponnusamy, R., Nashat, M., Choudary, A. and Fox, G., Graph contraction and physical optimization methods: a quality-cost tradeoff for mapping data on parallel computers. In Int. Conf. on Supercomputing, 1993.