The Community for Technology Leaders
Parallel Processing Symposium, International (1994)
Cancun, Mexico
Apr. 27, 1994 to Apr. 27, 1994
ISBN: 0-8186-5602-6
pp: 253-257
Hue , Dept. of Comput. Sci., Univ. of Central Florida, Orlando, FL, USA
Lee , Dept. of Comput. Sci., Univ. of Central Florida, Orlando, FL, USA
Lang , Dept. of Comput. Sci., Univ. of Central Florida, Orlando, FL, USA
ABSTRACT
We investigate the parallelism of simulated annealing for graph partitioning. A random sampling technique, in which disjoint partitions of the graph are distributed across the processors so that moves can be proposed and evaluated asynchronously in distinct processors, is proposed. Synchronizations among processors are not necessary until the equilibrium is reached at each processor. Such an approach may thus achieve a speedup that is approximately linear in the number of processors. Furthermore, since no interacting moves can occur in our strategy, it is obvious that our scheme is free of errors in cost evaluation.
INDEX TERMS
random sampling, parallel simulated annealing, graph partitioning, cost evaluation, shared memory architecture
CITATION

Lang, Lee and Hue, "On random sampling for parallel simulated annealing," Parallel Processing Symposium, International(IPPS), Cancun, Mexico, 1994, pp. 253-257.
doi:10.1109/IPPS.1994.288292
182 ms
(Ver 3.3 (11022016))