Compilation Optimization of Multi-Condition Predicate on BWDSP104X
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    At present, the BWDSP104X compiler deals with the conditional branching in the program by using the traditional predicate optimization method, and each instruction is associated with a predicate. Only when the predicate is true, can the instruction be executed. But its existence is limited when the conditional predicates do not eliminate jump branches, and there may be control dependencies between multiple conditional predicates, which is detrimental to instruction parallelism and instruction flow. Therefore, in the framework of the existing compiler, this paper proposes a multi-condition predicate compiler optimization method based on BWDSP104X architecture in view of the shortcomings of traditional predicate optimization method. The experimental results show that the optimization algorithm can achieve an average speed of 5.62 on the BWDSP104X compiler compared with the traditional predicate optimization method.

    Reference
    Related
    Cited by
Get Citation

韩东科,郑启龙,张仁高. BWDSP104X多条件谓词编译优化.计算机系统应用,2018,27(1):201-205

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 29,2017
  • Revised:April 20,2017
  • Adopted:
  • Online: December 22,2017
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063