skip to main content
10.1145/207110.207139acmconferencesArticle/Chapter ViewAbstractPublication PagespldiConference Proceedingsconference-collections
Article
Free Access

Storage assignment to decrease code size

Published:01 June 1995Publication History

ABSTRACT

DSP architectures typically provide indirect addressing modes with auto-increment and decrement. In addition, indexing mode is not available, and there are usually few, if any, general-purpose registers. Hence, it is necessary to use address registers and perform address arithmetic to access automatic variables. Subsuming the address arithmetic into auto-increment and auto-decrement modes improves the size of the generated code.

In this paper we present a formulation of the problem of optimal storage assignment such that explicit instructions for address arithmetic are minimized. We prove that for the case of a single address register the decision problem is NP-complete. We then generalize the problem to multiple address registers. For both cases heuristic algorithms are given. Our experimental results indicate an improvement of 3.

References

  1. 1.A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.A. Aho, R. Sethi, and J. Ullman. Compilers Principles, Techniques and Tools. Addison-Wesley, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.G. Araujo, S. Devadas, K. Keutzer, S. Liao, S. Malik, A. Sudarsanam, S. Tjiang, and A. Wang. Challenges in code generation for embedded processors. In P. Marwedel and G. Goossens, editors, Code Generation for Embedded Processors. Kluwer Academic Publishers, 1995. In press.Google ScholarGoogle Scholar
  4. 4.John R. Ellis. A Compiler for VLiW Architectures. MIT Press, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.J. A. Fisher. Trace Scheduling: A Technique for Global Microcode Compaction. IEEE Trnsactions on Computers, C-30(7):478-490, 1981.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.J. G. Ganssle. The Art of Programming Embedded Systems. San Diego, CA: Academic Press, Inc., 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.G. Goossens, J. Rabaey, F. Catthoor, J Vanhoof, R. Jain, H. De Man, and J. Vandewalle. A Computer- Aided Design Methodology for Mapping DSP Algorithms onto Custom Multiprocessor Architectures. In Proceedings of IEEE International Symposium on Circuits and Systems, pages 924-925, May 1986.Google ScholarGoogle Scholar
  8. 8.S. Liao, S. Devadas, and K. Keutzer. Code Density Optimization for Embedded DSP Processors Using Data Compression Techniques. In Proceedings of the Chapel Hill Conference on Advanced Research in VLSI, March 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.S. Liao, S. Devadas, K. Keutzer, S. Tjiang, and A. Wang. Code Optimization Techniques for Embedded DSP Microprocessors. In Proceedings of the 32nd Design Automation Conference, June 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.C. Liem, T. May, and P. Paulin. Instruction-Set Matching and Selection for DSP and ASIP Code Generation. In Proceedings of European Design and Test Conference, March 1994.Google ScholarGoogle ScholarCross RefCross Ref
  11. 11.K. Rimey. A Compiler for Application-Specific signal Processors. PhD thesis, University of California, Berkeley, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.R. Wilson, R. French, C. Wilson, S. Amarasinghe, J. Anderson, S. Tjiang, S.-W. Liao, C.-W. Tseng, M. Hall, M. Lam, and J. Hennessy. SUIF: A Parallelizing and Optimizing Research Compiler. Technical Report CSL-TR-94-620, Stanford University, May 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Storage assignment to decrease code size

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            PLDI '95: Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
            June 1995
            335 pages
            ISBN:0897916972
            DOI:10.1145/207110

            Copyright © 1995 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 June 1995

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            PLDI '95 Paper Acceptance Rate28of105submissions,27%Overall Acceptance Rate406of2,067submissions,20%

            Upcoming Conference

            PLDI '24

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader