• DocumentCode
    1405164
  • Title

    Architecture-Aware Technique for Mapping Area-Time Efficient Custom Instructions onto FPGAs

  • Author

    Lam, Siew-Kei ; Srikanthan, Thambipillai ; Clarke, Christopher T.

  • Author_Institution
    Centre for High Performance Embedded Syst., Nanyang Techno logical Univ., Singapore, Singapore
  • Volume
    60
  • Issue
    5
  • fYear
    2011
  • fDate
    5/1/2011 12:00:00 AM
  • Firstpage
    680
  • Lastpage
    692
  • Abstract
    Area-time efficient custom instructions are desirable for maximizing the performance of reconfigurable processors. Existing data path merging techniques based on resource sharing can be deployed to improve area efficiency of custom instructions. However, these techniques lead to large increase in the critical path delay. In this paper, we propose a novel strategy that takes into account the architectural constraints of the FPGA device in order to realize custom instructions with low-area delay product. The proposed strategy is based on partitioning the custom instruction data paths into a set of basic clusters such that they can be combined using a heuristic-based cluster merging process to maximize the utilization of FPGA logic blocks. Unlike the resource sharing method, the proposed cluster merging process does not maximize sharing of common resources and this leads to lesser reliance on multiplexers for implementing custom instructions. Resource sharing is only applied sparingly at the final stage to increase utilization of logic blocks. We show that the proposed technique leads to more than 34 percent, 34 percent, and 42 percent average reduction in area costs for Spartan-3, Virtex-4, and Virtex-5 architectures, respectively, when compared to optimizations achieved through commercial synthesis tool. We have also shown that the proposed technique leads to more than 18 percent, 17 percent, and 13 percent average reduction in area costs for Spartan-3, Virtex-4, and Virtex-5, respectively, when compared to results obtained using one of the most efficient resource sharing-based method reported in the literature. In addition, the proposed technique outperforms the resource sharing-based method in terms of area-delay product, with average reductions of more than 27 percent, 34 percent, and 19 percent for Spartan-3, Virtex-4, and Virtex-5, respectively.
  • Keywords
    field programmable gate arrays; FPGA device; Spartan-3 architectures; Virtex-4 architectures; Virtex-5 architectures; architecture-aware technique; commercial synthesis tool; data path merging techniques; field programmable gate arrays; heuristic-based cluster merging process; logic blocks; low-area delay product; mapping area-time efficient custom instructions; reconfigurable processors; resource sharing method; Clustering algorithms; Field programmable gate arrays; Hardware; Merging; Multiplexing; Optimization; Resource management; Automatic synthesis; data-path design; real-time and embedded systems; reconfigurable hardware.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2010.237
  • Filename
    5669259