Abstract
Parallel Crystal Growth, a new parallel extension of Simulated Annealing (SA), is presented. Sub-problems — the crystals — are solved in parallel, and iteratively merged into bigger crystals. The essential novelty is that processors spend time in a specific sub-problem, only as long as it is worthwhile, by locally computed merging criteria. Intra crystal search, is not repeated. Only inter-crystal exploration is done after merging. Whole problem termination is similarly determined. This leads to controlled speedup super-linearity, as demonstrated by experimental results with the PVM implementation.
Preview
Unable to display preview. Download preview PDF.
References
Boissin N. and Lutton J.L.-“A Parallel Simulated Annealing Algorithm”-Parallel Computing 19, 859–872, (1993).
Darema, F., Kirkpatrick, S. and Norton, V.A.-“Parallel algorithms for chip placement by simulated annealing”-IBM J. Res. Develop. 31, 391–402 (1987).
Kernighan, B.W. and Lin, S.-”An efficient heuristic procedure for partitioning graphs”-Bell System Tech. J.-49, (2) 291–308 (1970).
Lee Kyung-Ceun and Lee Soo-Young-“Asynchronous Communication of Multiple Markov Chains in Parallel Simulated Annealing”-Int. Conf. on Parallel Processing, 169–176, (1992).
Nabhan, T.M. and Zomaya, A.Y.-“A Parallel Simulated Annealing Algorithm with Low Communication Overhead”-IEEE Trans. Parallel and Dist. Systems, 6, 1226–1233 (1995).
Sechen, C.-”VLSI Placement and Clobal Routing Using Simulated Annealing” Kluwer Academic Publishers-Boston-1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hirik, E., Exman, I. (1996). Parallel crystal growth for chip placement. In: Bode, A., Dongarra, J., Ludwig, T., Sunderam, V. (eds) Parallel Virtual Machine — EuroPVM '96. EuroPVM 1996. Lecture Notes in Computer Science, vol 1156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540617795_27
Download citation
DOI: https://doi.org/10.1007/3540617795_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61779-2
Online ISBN: 978-3-540-70741-7
eBook Packages: Springer Book Archive