A minimum-cost circulation approach to DSP address-code generation

被引:5
作者
Gebotys, CH [1 ]
机构
[1] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
digital signal processors; optimization methods; optimizing compilers; program compilers;
D O I
10.1109/43.766724
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a new approach to solving the DSP address code generation problem. A minimum cost circulation approach is used to efficiently generate high-performance addressing code in polynomial time. Results show that addressing code size improvements of up to 6x are obtained, accounting for up to 1.6x improvement in code size and performance of compiler-generated DSP code. This research is important for industry since this value-added technique can improve code size, energy dissipation, and performance, without increasing cost.
引用
收藏
页码:726 / 741
页数:16
相关论文
共 23 条
[1]  
Aho Alfred V., 2007, COMPILERS PRINCIPLES
[2]  
ARAUJO G, 1996, P INT S SYST SYNTH N, P103
[3]  
Brooke A, 1992, GAMS: a user's guide
[4]  
GAREY, 1979, COMPUTERS INTRACTABI
[5]  
GEBOTYS C, 1997, P INT C COMP AID DES, P100
[6]   An efficient model for DSP code generation: Performance, code size, estimated energy [J].
Gebotys, CH .
TENTH INTERNATIONAL SYMPOSIUM ON SYSTEM SYNTHESIS, PROCEEDINGS, 1997, :41-47
[7]  
KENNEDY K, 1971, P DES OPT COMP COUR, V5, P51
[8]  
Lawler E., 1976, Combinatorial Optimization: Networks and Matroids
[9]  
Lee MTC, 1997, IEEE T VLSI SYST, V5, P123, DOI 10.1109/92.555992
[10]  
LEUPERS R, 1998, ASP DAC FEB