Abstract
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biology, respectively, and are the most popular meta-heuristics or general-purpose optimization strategies. A hybrid algorithm for circuit partitioning, which uses tabu search to improve the simulated annealing meta-heuristics, is also proposed and compared with pure tabu search and simulated annealing algorithms, and also with a genetic algorithm. The solutions obtained are compared and evaluated by including the hybrid partitioning algorithm in a parallel test generator which is used to determine the test patterns for the circuits of the frequently used ISCAS benchmark set.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alpert, C.J., and Kahng, A., “Recent Developments in Netlist Partitioning: A survey”. Integration: the VLSIJournal, 19/ 1-2 (1995) 1–81. *** DIRECT SUPPORT *** A0008D07 00011
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gil, C., Ortega, J., Diaz, A.F., Montoya, M.G. (1998). Meta-heuristics for circuit partitioning in parallel test generation. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_702
Download citation
DOI: https://doi.org/10.1007/3-540-64359-1_702
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64359-3
Online ISBN: 978-3-540-69756-5
eBook Packages: Springer Book Archive