skip to main content
10.1145/1950413.1950450acmconferencesArticle/Chapter ViewAbstractPublication PagesfpgaConference Proceedingsconference-collections
research-article

The RLOC is dead - long live the RLOC

Published:27 February 2011Publication History

ABSTRACT

Are user specified layout constraints of significant value anymore? Certainly in the past the use of the RLOC layout constraint for Xilinx FPGAs was essential for achieving the best possible performance for many kinds of highly structured designs. However, have CAD tools evolved to the point where they can always compute layouts as good as (if not better than) humans? Or has the introduction of on-chip hard cores, which create an irregular 2D surface for layouts, made layout specification impractical? Or has the varying pitch and types of combinational logic blocks (CLBs) made it intractable to produce layout descriptions that are portable across architectures? We show that the use of layout constraints still delivers a large performance gain for Xilinx's recent Virtex-6 family of FPGAs. The performance gain is sometime large enough to accommodate a reduction of two speed grades.

References

  1. Hannah Bian, Andrew Ling, Jianwen Zhu, Alexander Choong, "Towards Scalable Placement for FPGAs", IEEE Symposium on FPGAs. 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. K. E. Batcher, "Sorting networks and their applications," In AFIPS Spring Joint Computing Conference, volume 32, 1969. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Per Bjesse, Koen Claessen, Mary Sheeran, Satnam Singh, "Lava: Hardware Design in Haskell," ICFP'98. Springer-Verlag LNCS, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Saar Drimer, "The Meaning and Reproducibility of FPGA Results", Chapter 5, PhD Thesis, "Security for Volatile FPGAs." The University of Cambridge. November, 2009.Google ScholarGoogle Scholar
  5. Peter Henderson, "Functional Geometry", Higher Order and Symbolic Computation, 15(4), 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Jason Lee and Lesley Shannon, "Predicting the Performance of Application-Specific NoCs Implemented on FPGAs", IEEE Symposium on FPGAs. 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. René Müller, Jens Teubner, Gustavo Alonso, "Streams on Wires: A Query Compiler for FPGAs", In Proceedings of the VLDB Endowment, Vol 2, No. 1--2, 2009. (VLDB 2009), Lyon, France. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. René Müller, Jens Teubner, Gustavo Alonso, "Data Processingon FPGAs", In Proceedings of the VLDB Endowment, Vol 2, No. 1--2, 2009. (VLDB 2009), Lyon, France. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Rishiyur Nikhil, "Bluespec SystemVerilog: Efficient, correct RTL from high-level specifications," Formal Methods and Models for Co-Design (MEMOCODE), 2004.Google ScholarGoogle Scholar
  10. Yi Shan, Bo Wang, Jing Yan, Yu Wang, Ningyi Xu2, Huazhong Yang, "FPMR : MapReduce Framework on FPGA - a Case Study of RankBoost Acceleration", IEEE Symposium on FPGAs. 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Satnam Singh, "Death of the RLOC?" IEEE Symposium on FPGAs for Custom Computing Machines (FCCM), April 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Jens Teubner, René Müller, Gustavo Alonso, "FPGA Acceleration for the Frequent Item Problem", In Proceedings of the 26th Int'l Conference on Data Engineering (ICDE), Long Beach, CA, USA March 2010Google ScholarGoogle ScholarCross RefCross Ref
  13. Jackson H. C. Yeung, C. C. Tsang, K. H. Tsoi, Bill S. H. Kwan, Chris C. C. Cheung, Anthony P. C. Chan and Philip H. W. Leong, "Map-reduce as a Programming Model for Custom Computing Machins", IEEE Symposium on FPGAs for Custom Computing Machines (FCCM), April 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The RLOC is dead - long live the RLOC

    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
      FPGA '11: Proceedings of the 19th ACM/SIGDA international symposium on Field programmable gate arrays
      February 2011
      300 pages
      ISBN:9781450305549
      DOI:10.1145/1950413

      Copyright © 2011 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: 27 February 2011

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Author Tags

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate125of627submissions,20%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader