This paper continues our investigation into the feasibility of exploiting the structure of a parallel program to guide its hardware implementation. We review previous work, and present our new approach to the problem based upon placing netlists hierarchically. It is found that appropriate constraints can be derived from the source code in a straight-forward way, and this information can be used...

In this paper we discuss the mapping of the physical problem of 2D crystallization with spherical boundary conditions onto a Simulated Annealing model, and the mapping of this model onto a parallel computer. We discuss some aspects of the finetuning of the simulation code and the overall behaviour, stability and scalability, of our parallel implementation.

A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellknown instances of the problem by using parallelism. The empirical evidence indicate that parallel simulated annealing can be applied with success to bicriterion optimization problems.

Parallel algorithms with quality equivalent to the simulated annealing placement algorithm for standard cells [23] are presented. The first, called heuristic spanning, creates parallelism by simultaneously investigating different areas of the plausible combinatorial search space. It is used to replace the high temperature portion of simulated annealing. The low temperature portion of Simulated ...

Simulatedannealing (SA) Wutiques have shown great potential to generate geologically realistic permeability fields by combining data from many sources, such as well logs, cores, and tracer tests. However, the application of SA in reservoir description and simulation is limited owing to its prohibitively large computational time requirement, even on modern MqXWornputem. This paper introduces an ...

In this paper, we propose a new hybrid scheme of parallel tempering and simulated annealing (hybrid PT/SA). Within the hybrid PT/SA scheme, a composite system with multiple conformations is evolving in parallel on a temperature ladder with various transition step sizes. The simulated annealing (SA) process uses a cooling scheme to decrease the temperature values in the temperature ladder to the...

Using the Matrix-Tree Theorem and coupling methods the convergence of the Parallel Chain (PC) algorithm to the set of global minima is established for various selection functions. It is illustrated that there may be convergence to a set of non-global minima when selecting one of the best states (Best-Wins strategy). In the latter case the convergence of the homogeneous PC algorithm is proved fo...

In this paper, a Temperature Parallel Simulated Annealing with Adaptive Neighborhood (TPSA/AN) for continuous optimization problems is introduced. TPSA/AN is based on the temperature parallel simulated annealing (TPSA), which is suitable for parallel processing, and the SA that Corana developed for continuous optimization problems. The moves in TPSA/AN are adjusted to have equal acceptance rate...

The Methodology to Parallelize Simulated Annealing (MPSA) leads to massive parallelization by executing each temperature cycle of the Simulated Annealing (SA) algorithm in parallel. The initial solution for each internal cycle is set through a Monte Carlo random sampling to adjust the Boltzmann distribution at the cycle beginning. MPSA uses an asynchronous communication scheme and any implement...