Minimizing cost of local variables access for DSP-processors

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Minimizing cost of local variables access for DSP-processors

Full text

Pdf (750 KB)

Source

Language, Compiler and Tool Support for Embedded Systems archive
Proceedings of the ACM SIGPLAN 1999 workshop on Languages, compilers, and tools for embedded systems table of contents

Atlanta, Georgia, United States

Pages: 20 - 27

Year of Publication: 1999

ISBN:1-58113-136-4

Also published in ...

Authors

Erik Eckstein	Atair Software GmbH, Esslinggasse 18, A-1010 Wien and Institut für Computersprachen, Technische Universität Wien, Argentinierstraβe 8, A-1040 Wien
Andreas Krall	Atair Software GmbH, Esslinggasse 18, A-1010 Wien and Institut für Computersprachen, Technische Universität Wien, Argentinierstraβe 8, A-1040 Wien

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 10, Citation Count: 6

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/314403.314424 What is a DOI?

ABSTRACT

Recent work on compilation for DSP-processors deals with optimizing access to local variables of functions. The common way is to use one or more address registers as pointers into the functions stack frame and modify it with post modify addressing modes (which are sometimes the only addressing modes). Additionally to previous work we present an algorithm which assigns frame pointer values over a whole procedure. Our algorithm also deals with basic blocks, which have no accesses to local variables. The algorithm works with a new data structure, the control flow line graph, which is derived from the control flow graph. In our experiments, the algorithm showed improvements to similar algorithms.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ASU86	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	Bar92	David H. Bartley, Optimizing stack frame accesses for processors with restricted addressing modes, Software—Practice & Experience, v.22 n.2, p.101-110, Feb. 1992 [doi>10.1002/spe.4380220202]
	LD98	Rainer Leupers , Fabian David, A uniform optimization technique for offset assignment problems, Proceedings of the 11th international symposium on System synthesis, p.3-8, December 02-04, 1998, Hsinchu, Taiwan, China
	LDK+96	Stan Liao , Srinivas Devadas , Kurt Keutzer , Steven Tjiang , Albert Wang, Storage assignment to decrease code size, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.3, p.235-253, May 1996 [doi>10.1145/229542.229543]
	LM96	Rainer Leupers , Peter Marwedel, Algorithms for address assignment in DSP code generation, Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, p.109-112, November 10-14, 1996, San Jose, California, United States
	RP99	Amit Rao , Santosh Pande, Storage assignment optimizations to generate compact and efficient code on embedded DSPs, Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, p.128-138, May 01-04, 1999, Atlanta, Georgia, United States
	SLD97	Ashok Sudarsanam , Stan Liao , Srinivas Devadas, Analysis and evaluation of address arithmetic capabilities in custom DSP architectures, Proceedings of the 34th annual conference on Design automation, p.287-292, June 09-13, 1997, Anaheim, California, United States [doi>10.1145/266021.266103]

CITED BY 6

	Guido Araujo , Guilherme Ottoni , Marcelo Cintra, Global array reference allocation, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.7 n.2, p.336-357, April 2002
	Jens Wagner , Rainer Leupers, C Compiler Design for an Industrial Network Processor, ACM SIGPLAN Notices, v.36 n.8, p.155-164, Aug. 2001
	Erik Eckstein , Bernhard Scholz, Addressing mode selection, Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization, March 23-26, 2003, San Francisco, California
	G. Chen , M. Kandemir , M. J. Irwin , J. Ramanujam, Reducing code size through address register assignment, ACM Transactions on Embedded Computing Systems (TECS), v.5 n.1, p.225-258, February 2006
	Desiree Ottoni , Guilherme Ottoni , Guido Araujo , Rainer Leupers, Offset assignment using simultaneous variable coalescing, ACM Transactions on Embedded Computing Systems (TECS), v.5 n.4, p.864-883, November 2006
	Guilin Chen , Mahmut Kandemir, Optimizing Address Code Generation for Array-Intensive DSP Applications, Proceedings of the international symposium on Code generation and optimization, p.141-152, March 20-23, 2005