DocumentCode
1483904
Title
Toward accurate models of achievable routing
Author
Kahng, Andrew B. ; Mantik, Stefanus ; Stroobandt, Dirk
Author_Institution
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
Volume
20
Issue
5
fYear
2001
fDate
5/1/2001 12:00:00 AM
Firstpage
648
Lastpage
659
Abstract
Models of achievable routing, i.e., chip wireability, rely on estimates of available and required routing resources. Required routing resources are estimated from placement or (a priori) using wire length estimation models. Available routing resources are estimated by calculating a nominal “supply” then take into account such factors as the efficiency of the router and the impact of vias. Models of achievable routing can be used to optimize interconnect process parameters for future designs or to supply objectives that guide layout tools to promising solutions. Such models must be accurate in order to be useful and must support empirical verification and calibration by actual routing results. In this paper, we discuss the validation of such models and we apply our validation process to three existing models. We find notable inaccuracies in the existing models when matched against real data. We then present a thorough analysis of the assumptions underlying these models. Based on this analysis, we discuss requirements for predictors of routing resources and make suggestions for a new model of achievable routing
Keywords
VLSI; integrated circuit interconnections; integrated circuit layout; integrated circuit modelling; network routing; VLSI design; chip wireability; integrated circuit layout; integrated circuit placement; interconnect process optimization; model validation; routing resources; via impact model; wire length estimation model; Calibration; Computer science; Design optimization; Information systems; Predictive models; Routing; Silicon; Very large scale integration; Wire; Wiring;
fLanguage
English
Journal_Title
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0278-0070
Type
jour
DOI
10.1109/43.920697
Filename
920697
Link To Document