Loading...
Please wait, while we are loading the content...
Similar Documents
Optimal Integer Delay Budgeting on Directed Acyclic Graphs (2003)
| Content Provider | CiteSeerX |
|---|---|
| Author | Bozorgzadeh, E. Ghiasi, S. Takahashi, A. Sarrafzadeh, M. |
| Description | Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. We present an optimal integer delay budgeting algorithm. Due to numerical instability and discreteness of libraries of components during library mapping in design optimization flow, integer solution for delay budgeting is essential. We prove that integer budgeting problem - a 20-year old open problem in design optimization [8]- can be solved optimally in polynomial time. We applied optimal delay budgeting in mapping applications on FPGA platform using preoptimized cores of FPGA libraries. For each application we go through synthesis and place and route stages in order to obtain accurate results. Our optimal algorithm outperforms ZSA algorithm [4] in terms of area by 10% on average for all applications. In some applications, optimal delay budgeting can speedup runtime of place and route up to 2 times. In Design Automation Conference |
| File Format | |
| Language | English |
| Publisher | ACM Press |
| Publisher Date | 2003-01-01 |
| Access Restriction | Open |
| Subject Keyword | Excess Delay Optimal Delay Budgeting Design Optimization Flow Design Quality Optimal Algorithm Outperforms Zsa Route Stage Optimal Integer Delay Optimal Integer Delay Budgeting Delay Budgeting Delay Budget Directed Acyclic Graph Integer Solution Accurate Result Fpga Library Polynomial Time Design Optimization Fpga Platform Integer Budgeting Problem 20-year Old Open Problem Library Mapping Timing Constraint Numerical Instability Preoptimized Core |
| Content Type | Text |
| Resource Type | Article |
