Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

On the trade-off between power and flexibility of FPGA clock networks

Published:19 September 2008Publication History
Skip Abstract Section

Abstract

FPGA clock networks consume a significant amount of power, since they toggle every clock cycle and must be flexible enough to implement the clocks for a wide range of different applications. The efficiency of FPGA clock networks can be improved by reducing this flexibility; however, reducing the flexibility introduces stricter constraints during the clustering and placement stages of the FPGA CAD flow. These constraints can reduce the overall efficiency of the final implementation. This article examines the trade-off between the power consumption and flexibility of FPGA clock networks.

Specifically, this article makes three contributions. First, it presents a new parameterized clock-network framework for describing and comparing FPGA clock networks. Second, it describes new clock-aware placement techniques that are needed to find a legal placement satisfying the constraints imposed by the clock network. Finally, it performs an empirical study to examine the trade-off between the power consumption of the clock network and the impact of the CAD constraints for a number of different clock networks with varying amounts of flexibility.

The results show that the techniques used to produce a legal placement can have a significant influence on power and the ability of the placer to find a legal solution. On average, circuits placed using the most effective techniques dissipate 5% less overall energy and are significantly more likely to be legal than circuits placed using other techniques. Moreover, the results show that the architecture of the clock network is also important. On average, FPGAs with an efficient clock network are up to 14.6% more energy efficient compared to other FPGAs.

References

  1. ACTEL. 2007. ProASIC3 flash family FPGAs datasheet: Device architecture (Jan.).Google ScholarGoogle Scholar
  2. ALTERA. 2005. Stratix II Device Handbook 1. Chapter 2 (Mar.).Google ScholarGoogle Scholar
  3. ALTERA. 2006. Stratix III Device Handbook 1. Chapter 6 (Nov.).Google ScholarGoogle Scholar
  4. Bakolgu, H. B. 1990. Machine organization and rent's rule. In Circuits, Interconnections, and Packaging for VLSI. Addison-Wesley, Reading, MA.Google ScholarGoogle Scholar
  5. Betz, V., Rose, J., and Marquardt, A. 1999. Architecture and CAD for Deep-Submicron FPGAs. Kluwer Academic. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Brynjolfson, I. and Zilic, Z. 2000. Dynamic clock management for low-power applications in FPGAs. In Proceedings of the IEEE Custom Integrated Circuits Conference (CICC), 139--142.Google ScholarGoogle Scholar
  7. Edahiro, M. and Lipton, R. J. 1996. Clock buffer placement algorithm for wire-delay-dominated timing model. In Proceedings of the Great Lakes Symposium on VLSI, 143--147. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Friedman, E. G. 2001. Clock distribution networks in synchronous digital integrated circuits. Proc. IEEE 89, 5 (May), 665--692.Google ScholarGoogle ScholarCross RefCross Ref
  9. George, V., Zang, H., and Rabaey, J. 1999. The design of a low-energy FPGAs. In Proceedings of the International Symposium on Low-Power Electronic Design (ISLPED), 188--193. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Lamoureux, J., and Wilton, S. J. E. 2005. On the interaction between power-aware computer-aided design algorithms for field-programmable gate arrays. J. Low Power Electron. 1, 2, 119--132.Google ScholarGoogle ScholarCross RefCross Ref
  11. Lamoureux, J. and Wilton, S. J. E. 2006. FPGA clock network architecture: Flexibility vs. area and power. In Proceedings of the ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA), 101--108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Lamoureux, J. and Wilton, S. J. E. 2007. Clock-Aware placement for FPGAs. In Proceedings of the International Conference on Field-Programmable Logic and Applications (FPL).Google ScholarGoogle Scholar
  13. Landman, B. S. and Russo, R. L. 1971. On a pin versus block relationship for partitions of logic graphs. IEEE Trans. Comput. C-20, 12, 1469--1479. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Li, F., Chen, D., He, L., and Cong, J. 2003. Architecture evaluation for power-efficient FPGAs. In Proceedings of the International Symposium on Field-Programmable Gate Arrays (FPGA), 175--184. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Nakamura, S. and Masson, G. M. 1982. Lower bounds on crosspoints in concentrators. IEEE Trans. Comput. 31, 12, 1173--1178. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Poon, K. K. W. and Wilton, S. J. E. 2005. A detailed power model for field-programmable gate arrays. ACM Trans. Des. Autom. Electron. Syst.10, 2 (Apr.), 279--302. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Natesan, V. and Bhatia, D. 1996. Clock-Skew constrained cell placement. In Proceedings of the International Conference on VLSI Design, 146--149. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Schabas, K. and Brown, S. D. 2003. Using logic duplication to improve performance in FPGAs. In Proceedings of the ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA), 136--142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Tuan, T., Kao, S., Rahman, A., Das, S., and Trimberger, S. 2006. A 90nm low-power FPGA for battery-powered applications. In Proceedings of the ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA), 3--11. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. XILINX. 2007. Virtex-5 User Guide. Chapter 2 (Feb).Google ScholarGoogle Scholar
  21. Zhu, K. and Wong, D. F. 1997. Clock skew minimization during FPGA placement. IEEE Trans. Comput. Aided Des. Integr. Circ. 16, 4 (Apr.), 376--385. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On the trade-off between power and flexibility of FPGA clock networks

        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

        Full Access

        • Published in

          cover image ACM Transactions on Reconfigurable Technology and Systems
          ACM Transactions on Reconfigurable Technology and Systems  Volume 1, Issue 3
          September 2008
          135 pages
          ISSN:1936-7406
          EISSN:1936-7414
          DOI:10.1145/1391732
          Issue’s Table of Contents

          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: 19 September 2008
          • Accepted: 1 April 2008
          • Revised: 1 March 2008
          • Received: 1 July 2007
          Published in trets Volume 1, Issue 3

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader