• DocumentCode
    798312
  • Title

    MCM routing algorithm based on a compatibility graph approach

  • Author

    Li, D. ; Carothers, J.D.

  • Author_Institution
    Arizona Univ., Tucson, AZ, USA
  • Volume
    32
  • Issue
    1
  • fYear
    1996
  • fDate
    1/4/1996 12:00:00 AM
  • Firstpage
    5
  • Lastpage
    6
  • Abstract
    A new algorithm for general area multichip module routing using a multi-candidate and compatibility graph approach, which maximises routing density while minimising vias and total wire length, is presented. Experimental results using standard industrial benchmarks show improved results relative to a commercial router and other previously proposed routers while offering flexibility for future incorporation of noise and delay constraints
  • Keywords
    circuit layout CAD; circuit optimisation; graph theory; multichip modules; network routing; MCM routing algorithm; compatibility graph; general area routing; multichip module; routing density; total wire length minimisation; vias minimisation;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19960024
  • Filename
    490692
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=798312