Issue No. 04 - October (1991 vol. 2)

ISSN: 1045-9219

pp: 483-494

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.97904

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. Witte, R. Chamberlain and M. Franklin, "Parallel Simulated Annealing using Speculative Computation," in

*IEEE Transactions on Parallel & Distributed Systems*, vol. 2, no. , pp. 483-494, 1991.

doi:10.1109/71.97904

CITATIONS