Code Overlay

From esoterum.org
Revision as of 15:28, 1 September 2009 by Baker (Talk | contribs)

Jump to: navigation, search

optimization]. developerWorks, IBM 07 Feb 2006

-"Call-graph partitioning faces challenges with very large single functions. Such functions are generally the result of aggressive optimizations, particularly function inlining and loop unrolling."


-University of Dortmund, Computer Science 12, 44221 Dortmund, Germany
-University of Maryland, College Park, MD
-Seoul National University, Seoul, Korea
  • (10.3) Federico Angiolini and Francesco Menichelli and Alberto Ferrero and Luca Benini and Mauro Olivieri. A post-compiler approach to scratchpad mapping of code. International Conference on Compilers, Architecture and Synthesis for Embedded Systems. Pages: 259 - 267. 2004.
-Università di Bologna, Bologna, Italy
-University of Bologna, Bologna, Bologna, Italy
-University of Dortmund, Computer Science 12, 44221 Dortmund, Germany
-University of Dortmund, Computer Science 12, 44221 Dortmund, Germany
-University of Maryland, College Park, MD
-Microsyst. Design Lab., Pennsylvania State Univ., University Park, PA, USA;
-Sch. of Comput. Sci. & Eng., New South Wales Univ., Sydney, NSW, Australia;

Dynamic Code Mapping

-Seoul National University, Korea
-The University of New South Wales, Sydney, Australia
-University of Dortmund, 44221 Dortmund, Germany
-University of Dortmund, Dortmund, Germany


Last printed: 10.14