Artículos de revistas
Improving Offset Assignment Through Simultaneous Variable Coalescing
Registro en:
Lecture Notes In Computer Science (including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics). , v. 2826, n. , p. 285 - 297, 2003.
3029743
2-s2.0-35248881544
Autor
Ottoni D.
Ottoni G.
Araujo G.
Leupers R.
Institución
Resumen
Efficient address code optimization is a central problem in code generation for processors with restricted addressing modes, like Digital Signal Processors (DSPs). This paper proposes a new heuristic to solve the Simple Offset Assignment (SOA) problem, the problem of allocating scalar variables to memory so as to minimize addressing code. This new approach, called Coalescing SOA (CSOA), performs variable memory slot coalescing simultaneously to offset assignment computation. Experimental results, based on compiling MediaBench benchmark programs with LANCE compiler, reveal a very significant improvement over the previous solutions to SOA. In fact, CSOA produces, on average, 37.3% fewer update instructions when comparing with the prior solution that perform memory slot coalescing before applying SOA, and 66.2% fewer update instructions when comparing with the best traditional SOA solution. © Springer-Verlag Berlin Heidelberg 2003. 2826
285 297 Aho, A.V., Sethi, R., Ullman, J.D., (1987) Addressing Modes for Fast and Optimal Code Generation Araujo, G., Ottoni, G., Cintra, M., Global array reference allocation (2002) ACM Trans. on Design Automation of Electronic Systems, 7 (2), pp. 336-357. , April Araujo, G., Sudarsanam, A., Malik, S., Instruction set design and optimizations for address computation in DSP architectures (1996) Proc. of the 9th. ACM/IEEE International Symposium on System Synthesis, pp. 102-107. , November Atri, S., Ramanujam, J., Kandemir, M., Improving offset assignment for embedded processors (2001) Lecture Notes in Computer Science, 2017 Bartley, D.H., Optimizing stack frame accesses for processors with restricted addressing modes (1992) Software - Practice and Experience, 22 (2), pp. 101-110 Choi, Y., Kim, T., Address assignment combined with scheduling in DSP code generation (2002) Proc. of the 39th Design Automation Conference, DAC 2002 Cintra, M., Araujo, G., Array reference allocation using ssaform and live range growth (2000) Proc. of the ACM SIGPLAN 2000 LCTES, pp. 26-33. , June LANCE Retargetable C Compiler, , http://ls12-www.cs.uni-dortmund.de/lance/ Eckstein, E., Krall, A., Minimizing cost of local variables access for DSP-processors (1999) Proc. of the ACM SIGPLAN 1999 LCTES Kempe, A., On the geografical problem of four colors (1879) Amer. J. Math, 2 Kogure, N., Sugino, N., Nishihara, A., Memory address allocation method with ±2 update operations in indirect addressing (1997) European Conference on Circuit Theory and Design (ECCTD) Kruskal, J.B., On the shortest spanning subtree of a graph and the traveling salesman problem (1956) Proceedings of the American Mathematical Society, 7, pp. 48-50 Lee, C., Potkonjak, M., William, H., Mangione-Smith, Mediabench: A tool for evaluating and synthesizing multimedia and communications systems (1997) Proc. of the 30th Annual International Symposium on Microarchitecture (Micro 30), , December Leupers, R., Code generation for embedded processors (2000) International System Synthesis Symposium Leupers, R., Offset assignment showdown: Evaluation of DSP address code optimization algorithms (2003) Proceedings of the 12th International Conference on Compiler Construction, , April Leupers, R., Basu, A., Marwedel, P., Optimized array index computation in DSP programs (1998) Proc. of the Asia South Pacific Design Automation Conference (ASP-DAC), , IEEE, February Leupers, R., David, F., A uniform optimization technique for offset assignment problems (1998) Proc. of the International Symposium on System Synthesis (ISSS), pp. 3-8 Leupers, R., Marwedel, P., Algorithms for address assignment in DSP code generation (1996) International Conference on Computer-Aided Design (IC-CAD), pp. 109-112 Liao, S., (1996) Code Generation and Optimization for Embedded Digital Signal Processors, , Ph.D thesis, Massachusetts Institute of Technology Liao, S., Devadas, S., Keutzer, K., Tjiang, S., Wang, A., Storage assignment to decrease code size (1996) ACM Transactions on Programming Languages and Systems, 18 (3), pp. 235-253. , May Muchnick, S.S., (1997) Advanced Compiler Design and Implementation, , Morgan Kaufmann http:///www.address-code-optimization.org, OffsetStoneOttoni, G., Rigo, S., Araujo, G., Rajagopalan, S., Malik, S., Optimal live range merge for address register allocation in embedded programs (2001) LNCS 2027, pp. 274-288. , Proceedings of the 10th International Conference on Compiler Construction, CC 2001, Springer, April Rao, A., Pande, S., Storage assignment optimizations to generate compact and efficient code on embedded DSPs (1999) SIGPLAN Conference on Programming Language Design and Implementation, pp. 128-138 Sudarsanam, A., Liao, S., Devadas, S., Analysis and evaluation of address arithmetic capabilities in custom DSP architectures (1997) Design Automation Conference, pp. 287-292 Wess, B., Gotschlich, M., Optimal DSP memory layout generations a quadratic assignment problem (1997) Int. Symp. on Circuits and Systems (ISCAS)