DocumentCode :
2736127
Title :
A performance driven probabilistic resource allocation algorithm for analog routers
Author :
Du, Changxu ; Cai, Yici ; Hong, Xianlong
Author_Institution :
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing
fYear :
2008
fDate :
10-13 Aug. 2008
Firstpage :
730
Lastpage :
733
Abstract :
The phase of resource allocation is always ignored in analog routers, since the small scale of analog integrated circuits does not require it. However, in this paper, we introduce a novel resource allocation algorithm, for the traditional greedy strategy without resource allocation cannot meet many performance requirements of analog integrated circuits at all. This algorithm is based on the probabilistic model, considering the important performance requirements, such as variable wire widths, matching, and sensitivity, of analog integrated circuits. Factors about performance are involved in the routing phase in advance, by contrast to the traditional approaches that pay only attention to the wire congestion. Experimental results demonstrate that the routability of nets, especially critical nets, is improved, and the wire congestion in different metal layers is manipulated well, with the guarantee of much significant performance.
Keywords :
analogue integrated circuits; network routing; analog integrated circuits; analog routers; greedy strategy; performance requirements; probabilistic resource allocation algorithm; wire congestion; Analog circuits; Analog integrated circuits; Capacitance; Digital integrated circuits; Electronic design automation and methodology; Integrated circuit technology; Predictive models; Resource management; Routing; Wire;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2008. MWSCAS 2008. 51st Midwest Symposium on
Conference_Location :
Knoxville, TN
ISSN :
1548-3746
Print_ISBN :
978-1-4244-2166-4
Electronic_ISBN :
1548-3746
Type :
conf
DOI :
10.1109/MWSCAS.2008.4616903
Filename :
4616903
Link To Document :
بازگشت