Abstract
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.
Research of the first two and last authors was supported by the EPSRC grant GR/R37395/01. Research of the second and the last authors was supported by the Slovak Scientific Grant Agency grant No. 2/3164/23.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
O. Bastert, C. Matuszewski. (2001). Layered drawings of digraphs, In: Drawing Graphs, Methods and Models (eds. M. Kaufmann, D. Wagner), Lecture Notes in Computer Science 2025, Springer Verlag, 87–118.
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/.
C. Demetrescu., I. Finocchi. (2001). Removing cycles for minimizing crossings. J. Experimental Algorithmics. To appear.
G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis. (1999). Graph Drawing: Algorithms for Visualization of Graphs. Prentice Hall.
P. Eades, N. Wormald. (1994). Edge crossings in drawings of bipartite graphs, Algorithmica, 11 379–403.
J.A. Gallian. (1989). A survey: recent results, conjectures and open problems in labelling graphs, J. Graph Theory 13 491–504.
M.R. Garey, D.S. Johnson. (1983). Crossing number is np -complete, SIAM J. Algebraic Discrete Meth., 4 312–316.
E. Mäkinen, M. Sieranta. (1994). Genetic algorithms for drawing bipartite graphs, International J. Computer Mathematics 53 157–166.
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.
P. Mutzel. (2001). Optimization in leveled graphs. In: M. Pardalos, C.A. Floudas (eds.): Encyclopedia of Optimization. Kluwer, Dordrecht.
H. Purchase. (1998). Which aesthetic has the greatest effect on human understanding?, in Proc. Symposium on Graph Drawing, GD’97, Lecture Notes in Comput. Sci., 1353, Springer Verlag, Berlin, 248–261.
M. Sarrafzadeh, C.K. Wong. (1996). An Introduction to VLSI Physical Design, McGraw Hill, New York, NY.
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.
F. Shahrokhi, O. Sýkora, L.A. Székely, I. Vrťo. (2000). A new lower bound for the bipartite crossing number with algorithmic applications, Theoretical Computer Science 245 281–294.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Newton, M., Sýkora, O., Withall, M., Vrt’o, I. (2003). A Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing. In: Chung, P.W.H., Hinde, C., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2003. Lecture Notes in Computer Science(), vol 2718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45034-3_76
Download citation
DOI: https://doi.org/10.1007/3-540-45034-3_76
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40455-2
Online ISBN: 978-3-540-45034-4
eBook Packages: Springer Book Archive