ACM Home Page
Please provide us with feedback. Feedback
Skew-programmable clock design for FPGA and skew-aware placement
Full text PdfPdf (184 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays table of contents
Monterey, California, USA
SESSION: Advances in FPGA CAD table of contents
Pages: 33 - 40  
Year of Publication: 2005
ISBN:1-59593-029-9
Authors
Chao-Yang Yeh  University of California, Santa Barbara, CA
Malgorzata Marek-Sadowska  University of California, Santa Barbara, CA
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 26,   Citation Count: 1
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/1046192.1046198
What is a DOI?

ABSTRACT

In this paper, we propose a skew-programmable clock-routing architecture. The skews can be adjusted using programmable delay elements (PDEs) which we insert into the clock trees. We develop efficient, shortest-path-based algorithms for programming PDEs to optimize timing. Unlike previous methods for FPGA skew optimization which require large power and routing penalty, our method can achieve large timing improvement with small overhead. Typically, if timing requirements are tight, placers make efforts to satisfy them, often at a cost of compromising routability, total wire length, and power. In this work, we propose novel clock-skew-aware placement algorithms which allow us to relax the timing constraints during placement. Timing can be later optimized as a post process. Even though we demonstrate the efficiency of our approach using FPGAs, the new skew optimization method and the new placement algorithm are quite general and can be applied to any general, topology-constrained skew optimization problem. Experimental results indicate that using the new clock-architecture we can obtain a 22% timing improvement for post-layout skew optimization and an additional 21% improvement from our skew-aware placement algorithm. In one fabric, the cost of added logic is 2.19% as measured by dynamic power dissipation, and 0.85% in terms of area overhead.


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
ITC'99 benchmarks, www.cerc.utexas.edu/itc99-benchmarks
 
2
3
 
4
5
6
7
 
8
A. Srinivasan, K. Chaudhary, E.S. Kuh, "RITUAL: a performance driven placement algorithm", Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on, Volume: 39 Issue: 11, Nov. 1992 pp: 825--840.
9
 
10
 
11
S. Tam, S. Rusu, U. N. Desai, R. Kim, J. Zhang and I. Young, "Clock Generation and Distribution for the First IA-64 Microprocessor", IEEE journal of solid-state circuits, vol. 35, no. 11, november 2000.
 
12


Collaborative Colleagues:
Chao-Yang Yeh: colleagues
Malgorzata Marek-Sadowska: colleagues