Stack size reduction of recursive programs

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.

Recursively-Defined Combinatorial Functions: The Case of Binomial and Multinomial Coefficients and Probabilities

“…The Signal Flow Graphs represented herein are truly insightful for recursion elimination or removal [6,10,[73][74][75][76][77][78][79][80], i.e., for replacing a recursive algorithm by a non-recursive or iterative one. Non-recursive algorithms already exist for the binomial coefficients [6,20] and for the binomial probability [1][2][3]6,10,23,24].…”

Compiler directed automatic stack trimming for efficient non-volatile processors

“…The work in [9] employs global function inlining to reduce maximum stack memory requirements. Some work proposes to reduce the stack size by keeping only one instance of a local variable in recursive programs if it is guaranteed that this local variable is at all recursive calls [10]. In this work, we conduct stack trimming from a different angle by manipulating frames of the caller and callee functions.…”

Rethinking Java call stack design for tiny embedded devices

“…Schäckeler and Shang [18] observe that many local variables are dead at recursive calls and propose to allocate them globally thus evading them from stack frames. Taken to the extreme, this idea amounts to the well-known tail call optimization [9], where the entire frame is reused by the next function call if all local variables are dead and there is no further computation after the call.…”