FPGA-aware techniques for rapid generation of profitable custom instructions

A. Prakash, S.-K. Lam, C.T. Clarke, T. Srikanthan

Research output: Contribution to journalArticle

  • 3 Citations

Abstract

Instruction set extension of FPGA based reconfigurable processors provides an effective means to meet the increasingly strict design constraints of embedded systems. We have shown in our previous works [20,21] that the usage of FPGA architectural constraints for pruning the design space during enumeration of custom instructions/patterns not only leads to notable reduction in the time taken to identify custom instructions but can also result in the selection of profitable custom instructions when the area is highly constrained. However when area constraint is relaxed, the previously proposed methods failed to perform better than traditional methods. In this paper, we propose a heuristic to identify profitable custom instructions for designs with arbitrary area constraints. The proposed heuristic relies on a new pruning criterion to enumerate patterns with high size-to-hardware-area ratio. We also proposed a suitable algorithm to select profitable custom instructions from the enumerated patterns. The proposed template selection algorithm takes advantage of the FPGA area-time measures of the enumerated patterns, which can be easily inferred from the FPGA-aware enumeration strategy. Experimental results show that the proposed methods in this paper result in custom instructions that achieve an average performance gain of 76.23% over current state-of-the-art approaches
LanguageEnglish
Pages259-269
Number of pages11
JournalMicroprocessors and Microsystems
Volume37
Issue number3
DOIs
StatusPublished - May 2013

Fingerprint

Field programmable gate arrays (FPGA)
Embedded systems
Hardware

Cite this

FPGA-aware techniques for rapid generation of profitable custom instructions. / Prakash, A.; Lam, S.-K.; Clarke, C.T.; Srikanthan, T.

In: Microprocessors and Microsystems, Vol. 37, No. 3, 05.2013, p. 259-269.

Research output: Contribution to journalArticle

Prakash, A. ; Lam, S.-K. ; Clarke, C.T. ; Srikanthan, T. / FPGA-aware techniques for rapid generation of profitable custom instructions. In: Microprocessors and Microsystems. 2013 ; Vol. 37, No. 3. pp. 259-269.
@article{caac7c3df34347069161aa03cb18bfb9,
title = "FPGA-aware techniques for rapid generation of profitable custom instructions",
abstract = "Instruction set extension of FPGA based reconfigurable processors provides an effective means to meet the increasingly strict design constraints of embedded systems. We have shown in our previous works [20,21] that the usage of FPGA architectural constraints for pruning the design space during enumeration of custom instructions/patterns not only leads to notable reduction in the time taken to identify custom instructions but can also result in the selection of profitable custom instructions when the area is highly constrained. However when area constraint is relaxed, the previously proposed methods failed to perform better than traditional methods. In this paper, we propose a heuristic to identify profitable custom instructions for designs with arbitrary area constraints. The proposed heuristic relies on a new pruning criterion to enumerate patterns with high size-to-hardware-area ratio. We also proposed a suitable algorithm to select profitable custom instructions from the enumerated patterns. The proposed template selection algorithm takes advantage of the FPGA area-time measures of the enumerated patterns, which can be easily inferred from the FPGA-aware enumeration strategy. Experimental results show that the proposed methods in this paper result in custom instructions that achieve an average performance gain of 76.23{\%} over current state-of-the-art approaches",
author = "A. Prakash and S.-K. Lam and C.T. Clarke and T. Srikanthan",
year = "2013",
month = "5",
doi = "10.1016/j.micpro.2013.02.002",
language = "English",
volume = "37",
pages = "259--269",
journal = "Microprocessors and Microsystems",
issn = "0141-9331",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - FPGA-aware techniques for rapid generation of profitable custom instructions

AU - Prakash, A.

AU - Lam, S.-K.

AU - Clarke, C.T.

AU - Srikanthan, T.

PY - 2013/5

Y1 - 2013/5

N2 - Instruction set extension of FPGA based reconfigurable processors provides an effective means to meet the increasingly strict design constraints of embedded systems. We have shown in our previous works [20,21] that the usage of FPGA architectural constraints for pruning the design space during enumeration of custom instructions/patterns not only leads to notable reduction in the time taken to identify custom instructions but can also result in the selection of profitable custom instructions when the area is highly constrained. However when area constraint is relaxed, the previously proposed methods failed to perform better than traditional methods. In this paper, we propose a heuristic to identify profitable custom instructions for designs with arbitrary area constraints. The proposed heuristic relies on a new pruning criterion to enumerate patterns with high size-to-hardware-area ratio. We also proposed a suitable algorithm to select profitable custom instructions from the enumerated patterns. The proposed template selection algorithm takes advantage of the FPGA area-time measures of the enumerated patterns, which can be easily inferred from the FPGA-aware enumeration strategy. Experimental results show that the proposed methods in this paper result in custom instructions that achieve an average performance gain of 76.23% over current state-of-the-art approaches

AB - Instruction set extension of FPGA based reconfigurable processors provides an effective means to meet the increasingly strict design constraints of embedded systems. We have shown in our previous works [20,21] that the usage of FPGA architectural constraints for pruning the design space during enumeration of custom instructions/patterns not only leads to notable reduction in the time taken to identify custom instructions but can also result in the selection of profitable custom instructions when the area is highly constrained. However when area constraint is relaxed, the previously proposed methods failed to perform better than traditional methods. In this paper, we propose a heuristic to identify profitable custom instructions for designs with arbitrary area constraints. The proposed heuristic relies on a new pruning criterion to enumerate patterns with high size-to-hardware-area ratio. We also proposed a suitable algorithm to select profitable custom instructions from the enumerated patterns. The proposed template selection algorithm takes advantage of the FPGA area-time measures of the enumerated patterns, which can be easily inferred from the FPGA-aware enumeration strategy. Experimental results show that the proposed methods in this paper result in custom instructions that achieve an average performance gain of 76.23% over current state-of-the-art approaches

UR - http://www.scopus.com/inward/record.url?scp=84874839231&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1016/j.micpro.2013.02.002

U2 - 10.1016/j.micpro.2013.02.002

DO - 10.1016/j.micpro.2013.02.002

M3 - Article

VL - 37

SP - 259

EP - 269

JO - Microprocessors and Microsystems

T2 - Microprocessors and Microsystems

JF - Microprocessors and Microsystems

SN - 0141-9331

IS - 3

ER -