ACM Home Page
Please provide us with feedback. Feedback
Multilevel global placement with retiming
Full text PdfPdf (186 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 40th annual Design Automation Conference table of contents
Anaheim, CA, USA
SESSION: Timing-oriented placement table of contents
Pages: 208 - 213  
Year of Publication: 2003
ISBN:1-58113-688-9
Authors
Jason Cong  University of California, Los Angeles, CA
Xin Yuan  University of California, Los Angeles, CA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 13,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/775832.775887
What is a DOI?

ABSTRACT

Multiple clock cycles are needed to cross the global interconnects for multi-gigahertz designs in nanometer technologies. For synchronous designs, this requires retiming and pipelining on global interconnects. In this paper, we present a practical solution for simultaneous retiming and multilevel global placement for performance optimization, based on the theory and algorithms of sequential timing analysis (Seq-TA). We extend the Seq-TA to handle gates/clusters with multiple outputs and integrate it into a multilevel optimization framework for simultaneous retiming and placement. We also develop two speed-up techniques which enable the Seq-TA to be efficiently integrated into a simulated annealing-based multilevel coarse placement for large-scale designs. Experimental results show that (i) retiming can improve the performance (delay) by 14% on average when it is applied after placement; (ii) our approach for simultaneous retiming and placement can outperform the two-step approach (placement followed by retiming) by 10% on average in terms of delay minimization.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
P. Chong and R. K. Brayton. Characterization of feasible retimings. In Proc. Int. Workshop on Logic and Synthesis, pages 1--6, 2001.
 
3
J. Cong. An interconnect-centric design flow for nanometer technologies. In Proceedings of the IEEE, pages 505--527, April 2001.
4
 
5
6
 
7
J. Cong and C. Wu. An efficient algorithm for performance-optimal FPGA technology mapping with retiming. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 17(9):738--748, 1998.
 
8
J. Cong and X. Yuan. Multilevel global placement with retiming. Technical Report 03-0023, Computer Science Department, University of California, Los Angeles, 2003.
9
10
 
11
C. E. Leiserson and J. B. Saxe. Retiming synchronous circuitry. Algorithmica, pages 5--35, 1991.
12
 
13
 
14
I. Neumann and W. Kunz. Tight coupling of timing-driven placement and retiming. In Proc. IEEE Int. Symp. on Circuits and Systems, pages 351--354, 2001.
 
15
 
16
P. Pan, A. K. Karandikar, and C. L. Liu. Optimal clock period clustering for sequential circuits with retiming. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 17(6):489--498, 1998.
17
 
18
Semiconductor Industry Association. International Technology Roadmap for Semiconductors, 2002 update.
 
19
M. Senn, U. Seidl, and F. Johannes. High quality deterministic timing driven FPGA placement. In Proc. ACM/SIGDA Int. Symp. on Field Programmable Gate Arrays, 2002.
20
21

CITED BY  10