NDLI: Storage assignment optimizations to generate compact and efficient code on embedded DSPs

Please wait, while we are loading the content...

Cache-conscious structure layout

Cache-conscious structure definition

A semantics for imprecise exceptions

The design of a class mechanism for Moby

What is a recursive module?

Load-reuse analysis: design and evaluation

Pointer analysis for multithreaded programs

Pointer analysis for programs with structures and casting

On bounding time and space for multiprocessor garbage collection

Support for garbage collection at every instruction in a Java compiler

Storage assignment optimizations to generate compact and efficient code on embedded DSPs

Enhanced code compression for embedded RISC processors

Using node merging to enhance graph coloring

Control CPR: a branch height reduction optimization for EPIC architectures

A fast Fourier transform compiler

A new framework for debugging globally optimized code

A theory of type qualifiers

Static single assignment form for machine code

New tiling techniques to improve cache temporal locality

Improving cache performance in dynamic applications through data and computation reorganization at run time

Automatic inference of models for statistical code compression

Compressing Java class files

Whole program paths

Finite-state code generation

Efficient incremental run-time specialization for free

An evaluation of staged run-time optimizations in DyC

Storage assignment optimizations to generate compact and efficient code on embedded DSPs

Content Provider	ACM Digital Library
Author	Pande, Santosh Rao, Amit
Abstract	DSP architectures typically provide dedicated memory address generation units and indirect addressing modes with auto-increment and auto-decrement that subsume address arithmetic calculation. The heavy use of auto-increment and auto-decrement indirect addressing require DSP compilers to perform a careful placement of variables in storage to minimize address arithmetic instructions to generate compact and efficient DSP code. Liao et al. formulated the problem of storage assignment as the simple offset assignment problem (SOA) and the general offset assignment problem (GOA), and proposed heuristic solutions.The storage allocation of variables critically depends on the sequence of variable accesses. In this paper we present techniques to optimize the access sequence of variables by applying algebraic transformations (such as commutativity and associativity) on expression trees to obtain the least cost offset assignment. We develop a new formulation of this problem as the least cost access sequence problem (LCAS). Based on the proposed framework, we develop heuristic algorithms that determine empirically near-optimal solutions resulting in fewer address arithmetic instructions. We have implemented the proposed heuristic algorithms by extending the storage assignment optimization in the SPAM compiler back-end targeted for the TMS320C25 DSP. In the case of SOA, experimental results for programs from the DSPstone benchmark suite show an average improvement of 3.36% in static code size and an average relative speed-up of 7.28% over results obtained using existing SOA algorithms. The average code size reduction over code compiled with a naive storage assignment algorithm is 7.04%. The proposed framework has also been applied to the GOA problem and shows average code size reductions of 2.04% over results obtained using existing GOA algorithms, and average code size reductions of 10.84% over a naive GOA algorithm. Code size reduction and improvement in dynamic instruction counts could be valuable given limited memory and real-time response requirements placed on embedded systems.
Starting Page	128
Ending Page	138
Page Count	11
File Format	PDF
ISBN	1581130945
DOI	10.1145/301618.301653
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1999-05-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in