Path selection based acceleration of conditionals in CGRAs

Shri Hari Rajendran Radhika, Aviral Shrivastava, Mahdi Hamzeh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Coarse Grain Reconfigurable Arrays (CGRAs) are promising accelerators capable of achieving high performance at low power consumption. While CGRAs can efficiently accelerate loop kernels, accelerating loops with control flow (loops with if-then-else structures) is quite challenging. Existing techniques use predication to handle control flow execution - in which they execute operations from both the paths, but commit only the result of operations from the path taken by branch at run time. However, this results in inefficient resource usage and therefore poor mapping and lower acceleration. The state-of-the-art dual issue scheme fetches instructions from both the paths, but executes only the ones from the correct path but this scheme has an overhead in instruction fetch bandwidth. In this paper, we propose a solution in which after resolving the branching condition, we fetch and execute instructions only from the path taken by branch. Experimental results show that our solution achieves 34.6% better performance and 52.1% lower energy consumption on an average compared to state of the art dual issue scheme.

Original languageEnglish (US)
Title of host publicationProceedings -Design, Automation and Test in Europe, DATE
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages121-126
Number of pages6
Volume2015-April
ISBN (Print)9783981537048
StatePublished - Apr 22 2015
Event2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015 - Grenoble, France
Duration: Mar 9 2015Mar 13 2015

Other

Other2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015
CountryFrance
CityGrenoble
Period3/9/153/13/15

Fingerprint

Flow control
Particle accelerators
Electric power utilization
Energy utilization
Bandwidth

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Radhika, S. H. R., Shrivastava, A., & Hamzeh, M. (2015). Path selection based acceleration of conditionals in CGRAs. In Proceedings -Design, Automation and Test in Europe, DATE (Vol. 2015-April, pp. 121-126). [7092369] Institute of Electrical and Electronics Engineers Inc..

Path selection based acceleration of conditionals in CGRAs. / Radhika, Shri Hari Rajendran; Shrivastava, Aviral; Hamzeh, Mahdi.

Proceedings -Design, Automation and Test in Europe, DATE. Vol. 2015-April Institute of Electrical and Electronics Engineers Inc., 2015. p. 121-126 7092369.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Radhika, SHR, Shrivastava, A & Hamzeh, M 2015, Path selection based acceleration of conditionals in CGRAs. in Proceedings -Design, Automation and Test in Europe, DATE. vol. 2015-April, 7092369, Institute of Electrical and Electronics Engineers Inc., pp. 121-126, 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015, Grenoble, France, 3/9/15.
Radhika SHR, Shrivastava A, Hamzeh M. Path selection based acceleration of conditionals in CGRAs. In Proceedings -Design, Automation and Test in Europe, DATE. Vol. 2015-April. Institute of Electrical and Electronics Engineers Inc. 2015. p. 121-126. 7092369
Radhika, Shri Hari Rajendran ; Shrivastava, Aviral ; Hamzeh, Mahdi. / Path selection based acceleration of conditionals in CGRAs. Proceedings -Design, Automation and Test in Europe, DATE. Vol. 2015-April Institute of Electrical and Electronics Engineers Inc., 2015. pp. 121-126
@inproceedings{815cd63933954981a7549f30d4fe832b,
title = "Path selection based acceleration of conditionals in CGRAs",
abstract = "Coarse Grain Reconfigurable Arrays (CGRAs) are promising accelerators capable of achieving high performance at low power consumption. While CGRAs can efficiently accelerate loop kernels, accelerating loops with control flow (loops with if-then-else structures) is quite challenging. Existing techniques use predication to handle control flow execution - in which they execute operations from both the paths, but commit only the result of operations from the path taken by branch at run time. However, this results in inefficient resource usage and therefore poor mapping and lower acceleration. The state-of-the-art dual issue scheme fetches instructions from both the paths, but executes only the ones from the correct path but this scheme has an overhead in instruction fetch bandwidth. In this paper, we propose a solution in which after resolving the branching condition, we fetch and execute instructions only from the path taken by branch. Experimental results show that our solution achieves 34.6{\%} better performance and 52.1{\%} lower energy consumption on an average compared to state of the art dual issue scheme.",
author = "Radhika, {Shri Hari Rajendran} and Aviral Shrivastava and Mahdi Hamzeh",
year = "2015",
month = "4",
day = "22",
language = "English (US)",
isbn = "9783981537048",
volume = "2015-April",
pages = "121--126",
booktitle = "Proceedings -Design, Automation and Test in Europe, DATE",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Path selection based acceleration of conditionals in CGRAs

AU - Radhika, Shri Hari Rajendran

AU - Shrivastava, Aviral

AU - Hamzeh, Mahdi

PY - 2015/4/22

Y1 - 2015/4/22

N2 - Coarse Grain Reconfigurable Arrays (CGRAs) are promising accelerators capable of achieving high performance at low power consumption. While CGRAs can efficiently accelerate loop kernels, accelerating loops with control flow (loops with if-then-else structures) is quite challenging. Existing techniques use predication to handle control flow execution - in which they execute operations from both the paths, but commit only the result of operations from the path taken by branch at run time. However, this results in inefficient resource usage and therefore poor mapping and lower acceleration. The state-of-the-art dual issue scheme fetches instructions from both the paths, but executes only the ones from the correct path but this scheme has an overhead in instruction fetch bandwidth. In this paper, we propose a solution in which after resolving the branching condition, we fetch and execute instructions only from the path taken by branch. Experimental results show that our solution achieves 34.6% better performance and 52.1% lower energy consumption on an average compared to state of the art dual issue scheme.

AB - Coarse Grain Reconfigurable Arrays (CGRAs) are promising accelerators capable of achieving high performance at low power consumption. While CGRAs can efficiently accelerate loop kernels, accelerating loops with control flow (loops with if-then-else structures) is quite challenging. Existing techniques use predication to handle control flow execution - in which they execute operations from both the paths, but commit only the result of operations from the path taken by branch at run time. However, this results in inefficient resource usage and therefore poor mapping and lower acceleration. The state-of-the-art dual issue scheme fetches instructions from both the paths, but executes only the ones from the correct path but this scheme has an overhead in instruction fetch bandwidth. In this paper, we propose a solution in which after resolving the branching condition, we fetch and execute instructions only from the path taken by branch. Experimental results show that our solution achieves 34.6% better performance and 52.1% lower energy consumption on an average compared to state of the art dual issue scheme.

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

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

M3 - Conference contribution

SN - 9783981537048

VL - 2015-April

SP - 121

EP - 126

BT - Proceedings -Design, Automation and Test in Europe, DATE

PB - Institute of Electrical and Electronics Engineers Inc.

ER -