ACM Home Page
Please provide us with feedback. Feedback
Timing driven floorplanning on programmable hierarchical targets
Full text PdfPdf (753 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays table of contents
Monterey, California, United States
Pages: 85 - 92  
Year of Publication: 1998
ISBN:0-89791-978-5
Authors
S. A. Senouci  Institut National Polytechnique de Grenoble/CSI, 46. Avenue Felix Viallet 38031 Grenoble cedex, France
A. Amoura  Institut National Polytechnique de Grenoble/CSI, 46. Avenue Felix Viallet 38031 Grenoble cedex, France
H. Krupnova  Institut National Polytechnique de Grenoble/CSI, 46. Avenue Felix Viallet 38031 Grenoble cedex, France
G. Saucier  Institut National Polytechnique de Grenoble/CSI, 46. Avenue Felix Viallet 38031 Grenoble cedex, France
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Citation Count: 3
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/275107.275123
What is a DOI?

ABSTRACT

The goal of this paper is to perform a timing optimization of a circuit described b y a network of cells on a target structure whose connection delays ha v ediscrete values follo wing its hierarch y. The circuits is modelled by a set of timed cones whose delay histograms allow their classification into critical, potential critical and neutral cones according to predicted delays. The floorplanning is then guided b y this cone structuring and has two innov ativ e features:first, it is shown that the placement of the elements of the neutral cones has no impact on timing results, th us a significant reduction is obtained; second, despite a greedy approach, a near optimal floorplan is achieved in a large number of examples.


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.

SawTho95
 
SauBra93
KatsKoWaYo95
 
YousSait95
SwaSe95
 
YanWon95
H. ~ang, D. F. Wong "Circuit clustering for dell' minimization under area and pin constraints", Proc. of iEEE Int. Conf. on Comput.-Aided Design, 1995: 65-70.
RoySe94
 
SauBra93
RajWong93
 
ShiKuTsay92
 
HauNaiYof87
P.S. Hauge, R. Nair, E.J. Yoffa, "Circuit placement for predictable performance:', Proc. of IEEE Int. Conf. on Comput.-Aided Design, 1987: 88-91.
BurYou85


Collaborative Colleagues:
S. A. Senouci: colleagues
A. Amoura: colleagues
H. Krupnova: colleagues
G. Saucier: colleagues