The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - October (1991 vol.2)
pp: 483-494
ABSTRACT
<p>A parallel simulated annealing algorithm that is problem-independent, maintains the serial decision sequence, and obtains speedup which can exceed log/sub 2/P on P processors is discussed. The algorithm achieves parallelism by using the concurrency technique of speculative computation. Implementation of the parallel algorithm on a hypercube multiprocessor and application to a task assignment problem are described. The simulated annealing solutions are shown to be, on average, 28% better than the solutions produced by a random task assignment algorithm and 2% better than the solutions produced by a heuristic.</p>
INDEX TERMS
Index Termsproblem independent algorithm; speculative computation; parallel simulated annealingalgorithm; serial decision sequence; processors; concurrency; hypercube multiprocessor;task assignment problem; parallel algorithms; simulated annealing
CITATION
E.E. Witte, R.D. Chamberlain, M.A. Franklin, "Parallel Simulated Annealing using Speculative Computation", IEEE Transactions on Parallel & Distributed Systems, vol.2, no. 4, pp. 483-494, October 1991, doi:10.1109/71.97904
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool