A Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing
Parallel algorithms based on stochastic hill-climbing and parallel algorithms based on simple elements of a genetic algorithm for the one-sided bipartite crossing number problem, used in row-based VLSI layout, were investigated. These algorithms were run on a PVM cluster. The experiments show that the parallel approach does not bring faster computation but it does, however, much more importantly, bring a better quality solution to the problem, i.e. it generates drawings with lower numbers of pairwise edge crossings.
KeywordsGenetic Algorithms Distributed Problem Solving Heuristic Search
Unable to display preview. Download preview PDF.
- 2.J. Dongarra, G.A. Geist, J.A. Kohl, P.M. Papadopoulos, S. Scott, V. Sunderam. HARNESS: Heterogeneous Adaptable Reconfigurable Networked Systems. http://www.csm.ornl.gov/harness/.
- 3.C. Demetrescu., I. Finocchi. (2001). Removing cycles for minimizing crossings. J. Experimental Algorithmics. To appear.Google Scholar
- 4.G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis. (1999). Graph Drawing: Algorithms for Visualization of Graphs. Prentice Hall.Google Scholar
- 9.C. Matuszewski, R. Schönfeld, P. Molitor. (1999). Using sifting for k-layer straightline crossing minimization, in: Proc. 7th International Symposium on Graph Drawing (GD’99), LNCS 1731, 217–224.Google Scholar
- 10.P. Mutzel. (2001). Optimization in leveled graphs. In: M. Pardalos, C.A. Floudas (eds.): Encyclopedia of Optimization. Kluwer, Dordrecht.Google Scholar
- 12.M. Sarrafzadeh, C.K. Wong. (1996). An Introduction to VLSI Physical Design, McGraw Hill, New York, NY.Google Scholar
- 13.F. Shahrokhi, O. Sýkora, L.A. Székely, I. Vrťo. (1998). On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem, in Proc. Workshop on Algorithms and Data Structures, WADS’97, Lecture Notes in Comput. Sci. 1272, Springer-Verlag, Berlin, 55–68.Google Scholar