loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications (IWSOC'03)
STEINER TREE CONSTRUCTION BASED ON CONGESTION FOR THE GLOBAL ROUTING PROBLEM
Calgary, Alberta, Canada
June 30-July 02
ISBN: 0-7695-1944-X
ASCII Text
x 
 
Laleh Behjat, Anthony Vannelli, "STEINER TREE CONSTRUCTION BASED ON CONGESTION FOR THE GLOBAL ROUTING PROBLEM," System-on-Chip for Real-Time Applications, International Workshop on, pp. 28, The 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications (IWSOC'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/IWSOC.2003.1213000,
author = {Laleh Behjat and Anthony Vannelli},
title = {STEINER TREE CONSTRUCTION BASED ON CONGESTION FOR THE GLOBAL ROUTING PROBLEM},
journal ={System-on-Chip for Real-Time Applications, International Workshop on},
volume = {0},
year = {2003},
isbn = {0-7695-1944-X},
pages = {28},
doi = {http://doi.ieeecomputersociety.org/10.1109/IWSOC.2003.1213000},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - System-on-Chip for Real-Time Applications, International Workshop on
TI - STEINER TREE CONSTRUCTION BASED ON CONGESTION FOR THE GLOBAL ROUTING PROBLEM
SN - 0-7695-1944-X
SP
EP
A1 - Laleh Behjat,
A1 - Anthony Vannelli,
PY - 2003
KW - null
VL - 0
JA - System-on-Chip for Real-Time Applications, International Workshop on
ER -
 
Laleh Behjat, University of Calgary, Calgary, Alberta, Canada
Anthony Vannelli, University of Calgary, Calgary, Alberta, Canada
Global routing is an essential part of physical design, and has been traditionally formulated to minimize either an estimate of the total wirelength or the channel capacity of a circuit ignoring important issues such as congestion and number of bends. In this paper, a mathematical programming model that combines the wirelength minimization model and the channel capacity minimization model is presented. The combined model is also capable of incorporating different aspects of the global routing problem, such as via-count and congestion in two stages of the global routing problem: route construction and problem formulation. In addition, numerical enhancements have been proposed to increase the speed of the global routing formulation. Experiments on different benchmarks show that the new model builds a flexible and powerful technique that enhances the global routing solution compared to other mathematical programming techniques developed for global routing.
Citation:
Laleh Behjat, Anthony Vannelli, "STEINER TREE CONSTRUCTION BASED ON CONGESTION FOR THE GLOBAL ROUTING PROBLEM," iwsoc, pp.28, The 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications (IWSOC'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.