skip to main content
10.1145/1403375.1403629acmconferencesArticle/Chapter ViewAbstractPublication PagesdateConference Proceedingsconference-collections
research-article

Simultaneous FU and register binding based on network flow method

Published:10 March 2008Publication History

ABSTRACT

With the rapid increase of design complexity and the decrease of device features in nano-scale technologies, interconnection optimization in digital systems becomes more and more important. In this paper we develop a simultaneous FU and register (SFR) binding algorithm for multiplexer optimization based on min-cost network flow. Unlike most of the prior approaches in which functional unit binding and register binding are performed sequentially, our approach performs these two highly correlated tasks gradually and concurrently. We also present an ILP formulation of the combined functional unit and register binding problem for the optimality study of heuristics. Experimental results show that when compared to traditional binding algorithms, our simultaneous resource binding algorithm is close to optimal solutions for small-size designs (only 5% more MUX) and achieves significant reduction for MUX area (12%) and timing (10%) for a set of real-life benchmark designs.

References

  1. Xilinx Web Site, http://www.xilinx.com.Google ScholarGoogle Scholar
  2. J. M. Chang and M. Pedram, "Register Allocation and Binding for Low Power," Design Automation Conference, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Chen, J. Cong, and Y. Fan, "Low-Power High-Level Synthesis for FPGA Architectures," International Symposium on Low Power Electronics and Design, Seoul, Korea, pp. 134--139, Aug. 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Chen, and J. Cong, "Register Binding and Port Assignment for Multiplexer Optimization," ASPDAC, pp. 68--73, January 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. D. Chen, J. Cong, and J. Xu, "Optimal Module and Voltage Assignment for Low-Power," ASPDAC, pp. 850~855, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Cong, Y. Fan, G. Han, W. Jiang, and Z. Zhang, "Platform-Based Behavior-Level and System-Level Synthesis," Proceedings of IEEE International SOC Conference, pp. 199--202, Sept. 2006.Google ScholarGoogle Scholar
  8. C. Y. Huang, et al. "Data Path Allocation Based on Bipartite Weighted Matching," Design Automation Conference, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. T. Kim and C. L. Liu, "An Integrated Data Path Synthesis Algorithm Based on Network Flow Method," Proc. of the IEEE Custom Integrated Circuits Conference, 1995.Google ScholarGoogle Scholar
  10. F. Li, D. Chen, L. He and J. Cong, "Architecture Evaluation for Power-efficient FPGAs," ACM International Symposium on FPGA, Feb. 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. C. G. Lyuh and K. Taewhan, "High-level Synthesis for Low-Power Based on Network Flow Method," IEEE Trans. on VLSI Systems. 2003. 11(3): 364~375. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Barry Pangrle, "On the Complexity of Connectivity Binding," IEEE Tran. on Computer-Aided Design, Vol. 10, No. 11, Nov. 1991.Google ScholarGoogle Scholar
  13. B. M. Pangrle, "Splicer: A Heuristic Approach to Connectivity Binding," Design Automation Conference, pp. 536--541, Jun. 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. P. G. Paulin, J. P. Knight, and E. F. Girczyc, "HAL: A Multi-Paradigm Approach to Automatic Data Path Synthesis," Design Automation Conference, pp. 263--270, Jul. 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. Rim, R. Jain, and R. D. Leone, "Optimal Allocation and Binding in High-Level Synthesis," Design Automation Conference, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. A. Singh and M. Marek-Sadowska, "Efficient Circuit Clustering for Area and Power Reduction in FPGAs," ACM International Symposium on FPGA, Feb. 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. B. Srivastava and M. Potkonjak, "Optimum and Heuristic Transformation Techniques for Simultaneous Optimization of Latency and Throughput," Trans. on VLSI Systems, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Stephenson and P. Metzgen, "Logic Optimization Techniques for Multiplexers," Altera Literature, 2004.Google ScholarGoogle Scholar
  19. C-J. Tseng and D. P. Siewiorek, "Automated Synthesis of Data Path in Digital Systems," IEEE Tran. on CAD of ICAS, Vol. CADJ, No. 3, pp 379--395, Jul. 1986.Google ScholarGoogle Scholar
  20. H. W. Zhu and C. C. Jong, "Interconnection Optimization in Data Path Allocation Using Minimal Cost Maximal Flow Algorithm," Microelectronics, Vol. 33, No. 9, pp 749--59, Sept. 2002.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Simultaneous FU and register binding based on network flow method

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in
                • Published in

                  cover image ACM Conferences
                  DATE '08: Proceedings of the conference on Design, automation and test in Europe
                  March 2008
                  1575 pages
                  ISBN:9783981080131
                  DOI:10.1145/1403375

                  Copyright © 2008 ACM

                  Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 10 March 2008

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • research-article

                  Acceptance Rates

                  Overall Acceptance Rate518of1,794submissions,29%

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader