loading...
An Efficient Computation of Statistically Critical Sequential Paths Under Retiming
Yokohama January 23-January 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASPDAC.2007.3580432007 Asia and South Pacific Design Au ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mongkol Ekpanyapong, Intel Corporation, Folsom, California, USA. mongkol.ekpanyapong@intel.com
Xin Zhao, Georgia Institute of Technology, Atlanta, Georgia, USA. xzhao@ece.gatech.edu
Sung Kyu Lim, Georgia Institute of Technology, Atlanta, Georgia, USA. limsk@ece.gatech.edu
In this paper we present the Statistical Retiming-based Timing Analysis (SRTA) algorithm. The goal is to compute the timing slack distribution for the nodes in the timing graph and identify the statistically critical paths under retiming, which are the paths with a high probability of becoming timing-critical after retiming. SRTA enables the designers to perform circuit optimization on these paths to reduce the probability of them becoming timing bottleneck if the circuit is retimed as a post-process. We provide a comparison among static timing analysis (= STA), statistical timing analysis (= SSTA), retiming-based timing analysis (= RTA), and our statistical retiming-based timing analysis (SRTA). Our results show that the placement optimization based on SRTA achieves the best performance results.
Citation:
Mongkol Ekpanyapong, Xin Zhao, Sung Kyu Lim, "An Efficient Computation of Statistically Critical Sequential Paths Under Retiming," asp-dac, pp.547-552, 2007 Asia and South Pacific Design Automation Conference, 2007
Usage of this product signifies your acceptance of the Terms of Use.