Abstract
DSP architecture typically provides indirect addressing modes with auto-increment and auto-decrement. Subsuming the address arithmetic into auto-increment and auto-decrement modes improves the size and performance of generated code. A lot of previous work has been done on address assignment optimization to achieve code size reduction by minimizing address operations for single functional unit processors. However, minimizing address operations alone may not directly reduce code size and schedule length for multiple-functional-unit processors. In this paper, we exploit address assignment and scheduling for multiple functional units processors. Our approach is to first construct a nice address assignment and then do scheduling. By fully taking advantage of the address assignment during scheduling, code size and schedule length can be significantly reduced. We propose a multiple-functional-unit algorithm to do both address assignment and scheduling. The experimental results show that our algorithm can greatly reduce code size and schedule length compared to the previous work.
This work is partially supported by TI University Program, NSF EIA-0103709, Texas ARP 009741-0028-2001, NSF CCR-0309461, USA, and HK POLYU A-PF86 and COMP 4-Z077, HK.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Liao, S., Devadas, S., Keutzer, K., Tjiang, S., Wang, A.: Storage Assignment to Decrease Code Size. ACM Transactions on Programming Languages and Systems (TOPLAS) 18, 235–253 (1996)
Bartley, D.: Optimizing stack frame accesses for processors with restricted addressing modes. In: Sofware-Practice & Experience, John Wiley & Sons, Inc., Chichester (1979)
Leupers, R., Marwedel, P.: Algorithm for Address Assignment in DSP code Generation. In: IEEE/ACM International conference on Computer-aided design, pp. 109-112 (November 1996)
Leupers, R., David, F.: A Uniform Optimization Technique for Offset Assignment Problem. In: International Symposium on System Synthesis, pp. 3–8 (December 1998)
Gebotys, C.: DSP Address Optimization using a Minimum Cost Circulation Technique. In: IEEE/ACM International conference on Computer-aided Design, pp. 100–103 (November 1997)
Saip, H., Lucchesi, C.: Matching algorithm for bipartite graphs. DCC-93-03 (Departamento de Cincia da Computao, Universidade Estudal de Campinas) (March 1994), http://www.dee.unicamp.br/ic_tr_ftp/ALL/Abstrace.html
Rao, A., Pande, S.: Storage Assignment using Expression Tree Transformation to Generate Compact and efficient DSP Code. ACM SIGPLAN on Programming Language design and implementation (1999)
Lim, S., Kim, J., Choi, K.: Scheduling-based Code Size Reduction in Processors with Indirect Addressing Mode. In: International Symposium on Hardware/software Codesign, pp. 165–169 (April 2001)
Choi, Y., Kim, T.: Address Assignment Combined with Scheduling in DSP Code Generation. In: ACM IEEE Design Automation Conference, pp. 225–230 (June 2002)
Fredman, M., Tarjan, R.: Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. Journal of the ACM 34, 596–615 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xue, C., Shao, Z., Sha, E.H.M., Xiao, B. (2004). Optimizing Address Assignment for Scheduling Embedded DSPs. In: Yang, L.T., Guo, M., Gao, G.R., Jha, N.K. (eds) Embedded and Ubiquitous Computing. EUC 2004. Lecture Notes in Computer Science, vol 3207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30121-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30121-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22906-3
Online ISBN: 978-3-540-30121-9
eBook Packages: Springer Book Archive