6533b833fe1ef96bd129ca83
RESEARCH PRODUCT
Parallel Simulated Annealing: Getting Super Linear Speedups
A. Gencosubject
Mathematical optimizationSpeedupComputational complexity theoryJob shop schedulingParallel processing (DSP implementation)Computer scienceSimulated annealingDegree of parallelismFlow shop schedulingParallel computingHypercubedescription
The study described in this paper tries to improve and combine different approaches that are able to speed up applications of the Simulated Annealing model. It investigates separately two main aspects concerning the degree of parallelism an implementation can egectively exploit at the initial andfinal periods of an execution. As for case studies, it deals with two implementations: the Job shop Scheduling problem and the poryblio selection problem. The paper reports the results of a large number of experiments, carried out by means of a transputer network and a hypercube system. They give useful suggestions about selecting the most suitable values of the intervention parameters to achieve super linear speedups.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2005-08-24 | Proceedings. Second Euromicro Workshop on Parallel and Distributed Processing |