Loop scheduling with memory access reduction subject to register constraints for DSP applications†. (6th February 2013)

• Record Type: Journal Article
• Authors: Wang, Yi; Jia, Zhiping; Chen, Renhai; Wang, Meng; Liu, Duo; Shao, Zili
• Is Part Of: Software, practice & experience. Volume 44:Number 8(2014)
• Page Start: 999
• Page End: 1026
• Publication Date: 2013-02-06
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2186
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2186-abs-0001"> <title>SUMMARY</title> <p id="spe2186-para-0002">Memory accesses introduce big‐time overhead and power consumption because of the performance gap between processors and main memory. This paper describes and evaluates a technique, loop scheduling with memory access reduction (LSMAR), that replaces hidden redundant load operations with register operations in loop kernels and performs partial scheduling for newly generated register operations subject to register constraints. By exploiting data dependence of memory access operations, the LSMAR technique can effectively reduce the number of memory accesses of loop kernels, thereby improving timing performance. The technique has been implemented into the Trimaran compiler and evaluated using a set of benchmarks from DSPstone and MiBench on the cycle‐accurate simulator of the Trimaran infrastructure. The experimental results show that when the LSMAR technique is applied, the number of memory accesses can be reduced by 18.47% on average over the benchmarks when it is not applied. The measurements also indicate that the optimizations only lead to an average 1.41% increase in code size. With such small code size expansion, the technique is more suitable for embedded systems compared with prior work.Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>