Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
GLOBAL ROUTING FOR VLSI STANDARD CELLS Hao Sun and Shawki Areibi
 

Summary: GLOBAL ROUTING FOR VLSI STANDARD CELLS
Hao Sun and Shawki Areibi
School of Engineering
University of Guelph
CANADA N1G 2W1
E-mail:

hsun, sareibií @uoguelph.ca
ABSTRACT
Global routing is an important and time consuming step in
the VLSI physical design cycle. In order to effectively solve
this problem we present two standard cells global routing ap-
proaches: a heuristic approach and an Integer Linear program
(ILP) based approach. The objective of the heuristic approach
is to find the minimum cost path for each net by enumerating
a set of possible 2-bend routes. It is also parallelized by using
the Message Passing Interface (MPI) library to speed up the
running time and achieve better performance. The ILP based
approach formulates the global routing problem as an ILP
problem and then relaxes it as a Linear Programming (LP)

  

Source: Areibi, Shawki M - School of Engineering, University of Guelph

 

Collections: Engineering