𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Methodological Approach to Parallel Simulated Annealing on an SMP System

✍ Scribed by Alessandro Bevilacqua

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
217 KB
Volume
62
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

✦ Synopsis

Simulated annealing (SA) is a stochastic optimization technique which guarantees under certain conditions to converge to a global minimum. The major disadvantage of this technique is its very slow convergence: this makes it not suitable for many complex optimization problems. Different parallel versions of the algorithm have been proposed, but none of them addresses recent 2-way symmetric multiprocessor (SMP) machines. In this paper, we present a novel approach to the parallel implementation of SA on an SMP system. In addition, we offer an adaptive method to dynamically change the program execution flow at run time, as to obtain the maximum benefit from these shared memory parallel architectures. Since we only exploit time measures for this purpose, we obtain a problem independent and a general purpose implementation. The effectiveness of the method is demonstrated by extensively analyzing the traveling salesman problem (TSP) as a target case study, on a system under different workload conditions. # 2002 Elsevier Science (USA)

πŸ“œ SIMILAR VOLUMES

A simulated annealing approach to minimi
A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
✍ Kai Li; Shan-Lin Yang; Hua-Wei Ma πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 314 KB

This paper considers the uniform parallel machine scheduling problem which is to minimize the maximum lateness. This problem is equivalent to the uniform parallel machine scheduling problem, which is to minimize the maximal completion time of n jobs whose release times are zero, processing times dep

Simulated annealing task to processor ma
Simulated annealing task to processor mapping for domain decomposition methods on distributed parallel computers
✍ Pain, C. C.; de Oliveira, C. R. E.; Goddard, A. J. H. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 706 KB

The parallel solution of large sets of equations derived from finite element or finite difference methods often involves the use of domain decomposition methods. This paper is concerned with the related problem of mapping subdomain partitioning to a processor topology in such a way that the communic

A machine learning approach to inductive
A machine learning approach to inductive query by examples: An experiment using relevance feedback, ID3, genetic algorithms, and simulated annealing
✍ Chen, Hsinchun ;Shankaranarayanan, Ganesan ;She, Linlin ;Iyer, Anand πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 215 KB πŸ‘ 3 views

Information retrieval using probabilistic techniques has ## 1. Introduction attracted significant attention on the part of researchers in information and computer science over the past few In the past few decades, the availability of cheap and decades. In the 1980s, knowledge-based techniques effe

A simulation study with a combined netwo
A simulation study with a combined network and production systems model of pilot behavior on an ILS-approach
✍ B. DΓΆring; A. KnΓ€uper πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 793 KB

A simulation study was conducted for determining information flow requirements of a pilot-cockpit interface during an ILS-approach. Study steps for modeling, simulating, and analyzing system processes are discussed. Starting with the problem definition which includes relevant flight processes, the n