IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v6y2002i3d10.1023_a1014847925683.html
   My bibliography  Save this article

A Novel Eigenvector Technique for Large Scale Combinatorial Problems in VLSI Layout

Author

Listed:
  • Laleh Behjat

    (University of Waterloo)

  • Dorothy Kucar

    (University of Waterloo)

  • Anthony Vannelli

    (University of Waterloo)

Abstract

Modern integrated circuit design involves laying out circuits which consist of millions of switching elements or transistors. Due to the sheer complexity, optimizing the connectivity between transistors is a very difficult problem. How a circuit is interconnected is the single most important factor in performance criteria such as signal delay, power dissipation, circuit size and cost. These factors dictate that interconnections—wires, be made as short as possible. The wire–minimization problem is formulated as a sequence of discrete optimization subproblems. These problems are known to be NP-hard, hence they can only be solved approximately using meta-heuristics or linear programming techniques. Nevertheless, these methods are computationally expensive and the quality of solution depends to a great extent on an appropriate choice of starting configuration. A matrix reordering technique for solving very hard discrete optimization problems in Very Large Scale Integrated (VLSI) design which overcomes some of these shortcomings is proposed. In particular, the computational cost is reasonable—of the order of n 1.4 running time.

Suggested Citation

  • Laleh Behjat & Dorothy Kucar & Anthony Vannelli, 2002. "A Novel Eigenvector Technique for Large Scale Combinatorial Problems in VLSI Layout," Journal of Combinatorial Optimization, Springer, vol. 6(3), pages 271-286, September.
  • Handle: RePEc:spr:jcomop:v:6:y:2002:i:3:d:10.1023_a:1014847925683
    DOI: 10.1023/A:1014847925683
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1014847925683
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1014847925683?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kenneth M. Hall, 1970. "An r-Dimensional Quadratic Placement Algorithm," Management Science, INFORMS, vol. 17(3), pages 219-229, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Laleh Behjat & Anthony Vannelli & William Rosehart, 2006. "Integer Linear Programming Models for Global Routing," INFORMS Journal on Computing, INFORMS, vol. 18(2), pages 137-150, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gautier M Krings & Jean-François Carpantier & Jean-Charles Delvenne, 2014. "Trade Integration and Trade Imbalances in the European Union: A Network Perspective," PLOS ONE, Public Library of Science, vol. 9(1), pages 1-14, January.
    2. André R. S. Amaral, 2008. "An Exact Approach to the One-Dimensional Facility Layout Problem," Operations Research, INFORMS, vol. 56(4), pages 1026-1033, August.
    3. Bhupatiraju, Samyukta & Nomaler, Önder & Triulzi, Giorgio & Verspagen, Bart, 2012. "Knowledge flows – Analyzing the core literature of innovation, entrepreneurship and science and technology studies," Research Policy, Elsevier, vol. 41(7), pages 1205-1218.
    4. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
    5. Jintae Park & Sungha Yoon & Chaeyoung Lee & Junseok Kim, 2020. "A Simple Method for Network Visualization," Mathematics, MDPI, vol. 8(6), pages 1-13, June.
    6. Philipp Hungerländer & Franz Rendl, 2013. "A computational study and survey of methods for the single-row facility layout problem," Computational Optimization and Applications, Springer, vol. 55(1), pages 1-20, May.
    7. Nascimento, Mariá C.V. & de Carvalho, André C.P.L.F., 2011. "Spectral methods for graph clustering - A survey," European Journal of Operational Research, Elsevier, vol. 211(2), pages 221-231, June.
    8. Amaral, Andre R.S., 2006. "On the exact solution of a facility layout problem," European Journal of Operational Research, Elsevier, vol. 173(2), pages 508-518, September.
    9. Dorothy Kucar & Anthony Vannelli, 2006. "Using Eigenvectors to Partition Circuits," INFORMS Journal on Computing, INFORMS, vol. 18(2), pages 197-208, May.
    10. Dorit S. Hochbaum, 2013. "A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant," Operations Research, INFORMS, vol. 61(1), pages 184-198, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:6:y:2002:i:3:d:10.1023_a:1014847925683. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.