Load balanced parallel simulated annealing on a cluster of SMP nodes

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The paper focuses on a parallel implementation of a simulated annealing algorithm. In order to take advantage of the properties of modern clustered SMP architectures a hybrid method using a combination of OpenMP nested in MPI is advocated. The development of the reference implementation is proposed. Furthermore, a few load balancing strategies are introduced: time scheduling at the annealing process level, clustering at the basic annealing step level and suspending - inside of the basic annealing step. The application of the algorithm to VRPTW - a generally accepted benchmark problem - is used to illustrate their positive influence on execution time and the quality of results. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Debudaj-Grabysz, A., & Rabenseifner, R. (2006). Load balanced parallel simulated annealing on a cluster of SMP nodes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4128 LNCS, pp. 1075–1084). Springer Verlag. https://doi.org/10.1007/11823285_113

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free