@techreport{TR-IC-03-05,
  number = {IC-03-05},
  author = {Desiree Ottoni and Guilherme Ottoni and
            Guido Araujo and Rainer Leupers},
  title = {Improving Offset Assignment through Variable Coalescing},
  month = {April},
  year = {2003}, 
  institution = {Institute of Computing, University of Campinas},
  note = {In English, 12 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       Efficient address code optimization is a central problem in
       code generation for processors with restricted addressing
       modes, like Digital Signal Processors (DSPs).  This paper
       proposes a new heuristic to solve the Simple Offset Assignment
       (SOA) problem, the problem of allocating scalar variables to
       memory so as to minimize addressing code.  This new approach,
       called Coalescing SOA (CSOA), performs variable memory slot
       coalescing simultaneously to offset assignment computation.
       Experimental results, based on the MediaBench benchmark, reveal
       a very significant improvement over all known solutions to SOA.
       In fact, CSOA produces, on average, 66.5\% fewer update
       instructions, and reduces by 71.3\% the stack space for local
       variables, when comparing with the best known solution to SOA.
  }
}