How accurately can we model timing in a placement engine?

doi:10.1145/1065579.1065792

SIGN IN SIGN UP

How accurately can we model timing in a placement engine?

Full Text:

Pdf

Buy this Article

Authors:	Amit Chowdhary	Intel Corporation, Santa Clara, CA
	Karthik Rajagopal	Intel Corporation, Santa Clara, CA
	Satish Venkatesan	Intel Corporation, Santa Clara, CA
	Tung Cao	Intel Corporation, Santa Clara, CA
	Vladimir Tiourin	Intel Corporation, Santa Clara, CA
	Yegna Parasuram	Sierra Design Automation, Santa Clara, CA
	Bill Halpin	Synplicity, Inc., Sunnyvale, CA

	2005 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 19 · Citation Count: 9

Published in:

· Proceeding

DAC '05 Proceedings of the 42nd annual Design Automation Conference

ACM New York, NY, USA ©2005
table of contents ISBN:1-59593-058-2 doi>10.1145/1065579.1065792

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- DAC '12

Share:

|

Tags: algorithms design differential timing analysis linear programming performance placement and routing static timing analysis timing-driven placement

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder