ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Effective clustering technique to optimize routability of outer cluster nets
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 2006 ACM/SIGDA 14th international symposium on Field programmable gate arrays table of contents
Monterey, California, USA
POSTER SESSION: CAD table of contents
Pages: 229 - 229  
Year of Publication: 2006
ISBN:1-59593-292-5
Authors
Masaki Kobata  Kumamoto University, Kumamoto, Japan
Masahiro Iida  Kumamoto University, Kumamoto, Japan
Toshinori Sueyoshi  Kumamoto University, Kumamoto, Japan
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0
Additional Information:

abstract   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/1117201.1117247
What is a DOI?

ABSTRACT

We also study a clustering technique for a cluster-based FPGA to optimize the routability of outer cluster nets. Prior research of FPGA clustering aims to take in inter-cluster connections to utilize the various advantages of the local interconnection in the cluster. Taking in the inter-cluster connections to the cluster can improve the FPGA speed and area, and can lighten the burden of the placement and routing tool. However, many inter-cluster connections still remain in the outside cluster. The condition of these connections give the performance of the circuit big influence. Therefore, we propose the effective clustering technique to optimize routability of outer cluster nets which are not taken in. In order to reduce the used routing resources in FPGA, our technique uses two evaluation functions. One evaluation function can be reduced routing resources in the outside cluster. The second evaluation function can utilize various characteristics of the local routing resources in the inside cluster. Our clustering technique has the unusual ability in the optimization of routing resources concurrently. As a result, our method resulted in 21.4% improvement in terms of the routing area (16.6% on average), and the critical path delay is reduced by 28.0% (11.8% on average) compared to existing clustering method in the benchmark circuits.


Collaborative Colleagues:
Masaki Kobata: colleagues
Masahiro Iida: colleagues
Toshinori Sueyoshi: colleagues