Parallelizing simulated annealing algorithms based on high-performance computer
โ Scribed by Ding-Jun Chen; Chung-Yeol Lee; Cheol-Hoon Park; Pedro Mendes
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 669 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0925-5001
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Massively parallel (MP) computers provide increased capabilities for a wide range of engineering and physics simulations. High performance computing applications include quantum mechanics for materials modeling, charged particle beams for accelerator design, and computational fluid dynamics for glob
ln this paper, we consider the problem of scheduling a set of simultaneously available jobs on several parallel machines. Specifically, the minimization of the time to finish all the jobs assigned to all machines under job deadline constraints for n jobs, m machines problem is formulated in this pap
The use of a network of shared, heterogeneous workstations each harboring a reconfigurable computing (RC) system offers high performance users an inexpensive platform for a wide range of computationally demanding problems. However, effectively using the full potential of these systems can be challen
Heydorn, S. and P. Weidner, Optimization and performance analysis of thinning algorithms on parallel computers, Parallel Computing 17 (1991) 17-27. This paper presents a concept for an implementation of different parallel thinning algorithms on parallel processors. The emphasis is put on a good para