NDLI: Stack size reduction of recursive programs

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

A fast and generic hybrid simulation approach using C virtual machine

An integrated ARM and multi-core DSP simulator

Techniques for code and data management in the local stores of the cell processor

Towards understanding architectural tradeoffs in MEMS closed-loop feedback control

Rethinking custom ISE identification: a new processor-agnostic method

Lightweight barrier-based parallelization support for non-cache-coherent MPSoC platforms

Vertical object layout and compression for fixed heaps

An optimistic and conservative register assignment heuristic for chordal graphs

INTACTE: an interconnect area, delay, and energy estimation tool for microarchitectural explorations

Compiling code accelerators for FPGAs

Compiler generation from structural architecture descriptions

SCCP/x: a compilation profile to support testing and verification of optimized code

Recursive function data allocation to scratch-pad memory

Application driven embedded system design: a face recognition case study

An efficient framework for dynamic reconfiguration of instruction-set customization

Light-weight synchronization for inter-processor communication acceleration on embedded MPSoCs

Software controlled memory layout reorganization for irregular array access patterns

A simplified java bytecode compilation system for resource-constrained embedded processors

Cache leakage control mechanism for hard real-time systems

Multicore architectures

Non-transparent debugging for software-pipelined loops

Performance-driven syntax-directed synthesis of asynchronous processors

Fragment cache management for dynamic binary translators in embedded systems with scratchpad

Hierarchical coarse-grained stream compilation for software defined radio

Supporting multithreading in configurable soft processor cores

A self-maintained memory module supporting DMM

A backtracking instruction scheduler using predicate-based code hoisting to fill delay slots

Performance optimal processor throttling under thermal constraints

Stack size reduction of recursive programs

Scratch-pad memory allocation without compiler support for java applications

A group-based wear-leveling algorithm for large-capacity flash memory storage systems

Eliminating inter-process cache interference through cache reconfigurability for real-time and low-power embedded multi-tasking systems

A low power front-end for embedded processors using a block-aware instruction set

Performance evaluation and optimization of dual-port SDRAM architecture for mobile embedded systems

Facilitating compiler optimizations through the dynamic mapping of alternate register structures

A hybrid code compression technique using bitmask and prefix encoding with enhanced dictionary selection

Stack size reduction of recursive programs

Content Provider	ACM Digital Library
Author	Schaeckeler, Stefan Shang, Weijia
Abstract	For memory constrained environments like embedded systems, optimization for program size is often as important, if not more important, as optimization for execution speed. Commonly, compilers try to reduce the code segment and neglect the stack segment, although the stack can significantly grow during the execution of recursive functions as a separate activation record is required for each recursive call. An activation record holds administrative data like the return address and the frame pointer but also the function's formal parameter list and local variables. If a formal parameter or local variable is dead at all recursive calls, then it can be declared globally so that only one instance exists independent of the call depth. We found that in 70% of popular recursive algorithms and in all our real world benchmarks, it is possible to reduce the stack size by declaring formal parameters and local variables globally. Architectures might impose a penalty in code size for accessing global data. On IA32, this stack size reduction starts to materialize for our benchmarks no later than in the fifth recursion.
Starting Page	48
Ending Page	52
Page Count	5
File Format	PDF
ISBN	9781595938268
DOI	10.1145/1289881.1289892
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-09-30
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Embedded systems Stack size reduction Recursion
Content Type	Text
Resource Type	Article

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

Stack size reduction of recursive programs.

Efficient stack sizing for very large software systems

Generalized bottom up parsers with reduced stack activity

Generalized bottom up parsers with reduced stack activity (2005).

Code-Size Reduction for Embedded Systems using Bytecode Translation Unit

Live range splitting at recursive function calls

A type system for well-founded recursion

Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze

Formalizing Non-Termination of Recursive Programs (2001)

Stack size reduction of recursive programs

Similar Documents

Stack size reduction of recursive programs.

Efficient stack sizing for very large software systems

Generalized bottom up parsers with reduced stack activity

Generalized bottom up parsers with reduced stack activity (2005).

Code-Size Reduction for Embedded Systems using Bytecode Translation Unit

Live range splitting at recursive function calls

A type system for well-founded recursion

Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze

Formalizing Non-Termination of Recursive Programs (2001)

Stack size reduction of recursive programs