AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Regular Paper

A Pipelining Loop Optimization Method for Dataflow Architecture

State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China
School of Computer and Control Engineering, University of Chinese Academy of Sciences, Beijing 100049, China
State Key Laboratory of Mathematical Engineering and Advanced Computing, Wuxi 214125, China
College of Information Engineering, Capital Normal University, Beijing 100048, China
Department of Computer Science, The University of Chicago, Chicago, IL 60637, U.S.A.
Show Author Information

Abstract

With the coming of exascale supercomputing era, power efficiency has become the most important obstacle to build an exascale system. Dataflow architecture has native advantage in achieving high power efficiency for scientific applications. However, the state-of-the-art dataflow architectures fail to exploit high parallelism for loop processing. To address this issue, we propose a pipelining loop optimization method (PLO), which makes iterations in loops flow in the processing element (PE) array of dataflow accelerator. This method consists of two techniques, architecture-assisted hardware iteration and instruction-assisted software iteration. In hardware iteration execution model, an on-chip loop controller is designed to generate loop indexes, reducing the complexity of computing kernel and laying a good foundation for pipelining execution. In software iteration execution model, additional loop instructions are presented to solve the iteration dependency problem. Via these two techniques, the average number of instructions ready to execute per cycle is increased to keep floating-point unit busy. Simulation results show that our proposed method outperforms static and dynamic loop execution model in floating-point efficiency by 2.45x and 1.1x on average, respectively, while the hardware cost of these two techniques is acceptable.

Electronic Supplementary Material

Download File(s)
jcst-33-1-116-Highlights.pdf (213.3 KB)

References

【1】
【1】
 
 
Journal of Computer Science and Technology
Pages 116-130

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Tan X, Ye X-C, Shen X-W, et al. A Pipelining Loop Optimization Method for Dataflow Architecture. Journal of Computer Science and Technology, 2018, 33(1): 116-130. https://doi.org/10.1007/s11390-017-1748-5

1019

Views

8

Crossref

N/A

Web of Science

11

Scopus

2

CSCD

Received: 04 September 2016
Revised: 17 April 2017
Published: 26 January 2018
©2018 LLC & Science Press, China