Code Overlay: Difference between revisions

From esoterum.org
Jump to navigationJump to search
← Older edit
No edit summary
No edit summary
 
(25 intermediate revisions by the same user not shown)
Line 1: Line 1:
*M. Verma, P. Marwedel. [http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=01664902 Overlay techniques for scratchpad memories in low power embedded processors]. Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
*[[Overlay generator]] technical details and instructions
Publication Date: Aug. 2006 Volume: 14,  Issue: 8 On page(s): 802-815
:-Dept. of Comput. Sci., Dortmund Univ.


*Sumesh Udayakumaran and Angel Dominguez and Rajeev Barua. [http://portal.acm.org/citation.cfm?id=1151074.1151085 Dynamic allocation for scratch-pad memory using compile-time decisions]. ACM Transactions on Embedded Computing Systems (TECS). Volume 5 ,  Issue 2  Pages: 472 - 511. May 2006
 
=== Literature ===
*(10.16)Cytron, R. and Loewner, P. G. [http://portal.acm.org/citation.cfm?id=9931.9935&dl=GUIDE&dl=GUIDE&CFID=62477417&CFTOKEN=40689096 An automatic overlay generator]. IBM J. Res. Dev. 30, 6 (Nov. 1986), 603-608.
*(10.17)Spacek, T. R. 1972. [http://portal.acm.org/citation.cfm?id=361407# A proposal to establish a pseudo virtual memory via writable overlays]. Commun. ACM 15, 6 (Jun. 1972), 421-426.
 
*(10.15) Amit Pabalkar,  Aviral Shrivastava, Arun Kannan and Jongeun Lee. [http://www.springerlink.com/content/98qu566lq563008p/ SDRM: Simultaneous Determination of Regions and Function-to-Region Mapping for Scratchpad Memories]. High Performance Computing - HiPC 2008. Springer Berlin / Heidelberg. Volume Volume 5374/2008. Wednesday, December 17, 2008
 
*(10.14) Power Architecture editors (dwpower@us.ibm.com), [http://www.t-platforms.ru/images/pdf/pa-cbecompile5-a4.pdf An introduction to compiling for the Cell Broadband Engine architecture, Part 5: Managing memory Analyzing calling frequencies for maximum SPE partitioning 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."
 
 
*(10.1) M. Verma, P. Marwedel. [http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=01664902 Overlay techniques for scratchpad memories in low power embedded processors]. IEEE Transactions on Very Large Scale Integration (VLSI) Systems. Aug. 2006 Volume: 14,  Issue: 8 On page(s): 802-815
:-University of Dortmund, Computer Science 12, 44221 Dortmund, Germany 
 
*(10.11) Sumesh Udayakumaran and Angel Dominguez and Rajeev Barua. [http://portal.acm.org/citation.cfm?id=1151074.1151085 Dynamic allocation for scratch-pad memory using compile-time decisions]. ACM Transactions on Embedded Computing Systems (TECS). Volume 5 ,  Issue 2  Pages: 472 - 511. May 2006
:-University of Maryland, College Park, MD   
:-University of Maryland, College Park, MD   


*Bernhard Egger and Chihun Kim and Choonki Jang and Yoonsung Nam and Jaejin Lee and Sang Lyul Min. [http://portal.acm.org/citation.cfm?id=1176788 A dynamic code placement technique for scratchpad memory using postpass optimization]. International Conference on Compilers, Architecture and Synthesis for Embedded Systems archive
*(10.2) Bernhard Egger and Chihun Kim and Choonki Jang and Yoonsung Nam and Jaejin Lee and Sang Lyul Min. [http://portal.acm.org/citation.cfm?id=1176788 A dynamic code placement technique for scratchpad memory using postpass optimization]. International Conference on Compilers, Architecture and Synthesis for Embedded Systems. Pages: 223 - 233. 2006.
Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems. Pages: 223 - 233. 2006.
:-Seoul National University, Seoul, Korea  
:-Seoul National University, Seoul, Korea  


*Federico Angiolini and Francesco Menichelli and Alberto Ferrero and Luca Benini and Mauro Olivieri. [http://portal.acm.org/citation.cfm?id=1023869 A post-compiler approach to scratchpad mapping of code]. International Conference on Compilers, Architecture and Synthesis for Embedded Systems. Pages: 259 - 267. 2004.
*(10.3) Federico Angiolini and Francesco Menichelli and Alberto Ferrero and Luca Benini and Mauro Olivieri. [http://portal.acm.org/citation.cfm?id=1023869 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
:-Università di Bologna, Bologna, Italy


*Authors Manish Verma and Lars Wehmeyer and Peter Marwedel. [http://portal.acm.org/citation.cfm?id=968879.969148 Cache-Aware Scratchpad Allocation Algorithm]. Design, Automation, and Test in Europe. Page: 21264. 2004.
*(10.7) Federico Angiolini and Luca Benini and Alberto Caprara. [http://portal.acm.org/citation.cfm?id=951751 Polynomial-time algorithm for on-chip scratchpad memory partitioning]. International Conference on Compilers, Architecture and Synthesis for Embedded Systems. Pages: 318 - 326. 2003.
:-University of Bologna, Bologna, Bologna, Italy  
 
*(10.4) Manish Verma and Lars Wehmeyer and Peter Marwedel. [http://portal.acm.org/citation.cfm?id=968879.969148 Cache-Aware Scratchpad Allocation Algorithm]. Design, Automation, and Test in Europe. Page: 21264. 2004.
:-University of Dortmund, Computer Science 12, 44221 Dortmund, Germany 
 
*(10.5) S. Steinke and L. Wehmeyer and B. Lee and P. Marwedel. [http://portal.acm.org/citation.cfm?id=874049.874376 Assigning Program and Data Objects to Scratchpad for Energy Reduction]. Design, Automation, and Test in Europe. Page 409. 2002.
:-University of Dortmund, Computer Science 12, 44221 Dortmund, Germany
 
*(10.6) Oren Avissar and Rajeev Barua and Dave Stewart. [http://portal.acm.org/citation.cfm?id=581891 An optimal memory allocation scheme for scratch-pad-based embedded systems]. ACM Transactions on Embedded Computing Systems (TECS). Volume 1, Issue 1. Pages: 6 - 26. November 2002.
:-University of Maryland, College Park, MD
 
*M. Kandemir and J. Ramanujam and M.J. Irwin and N. Vijaykrishnan and I. Kadayif, A. Parikh. [http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=20239&arnumber=935595&type=ref Dynamic management of scratch-pad memory space]. Design Automation Conference. page(s): 690- 695. 2001.
:-Microsyst. Design Lab., Pennsylvania State Univ., University Park, PA, USA;
 
*(10.12) Lian Li and Lin Gao and Jingling Xue. [http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1515604 Memory coloring: a compiler approach for scratchpad memory management]. Parallel Architectures and Compilation Techniques. page(s): 329-338. September 2005.
:-Sch. of Comput. Sci. & Eng., New South Wales Univ., Sydney, NSW, Australia;
 
=== Dynamic Code Mapping ===
*(10.13) Bernhard Egger and Jaejin Lee and Heonshik Shin. [http://portal.acm.org/citation.cfm?id=1176933 Scratchpad memory management for portable systems with a memory management unit]. International Conference On Embedded Software. Pages: 321 - 330. 2006.
:-Seoul National University, Korea 
 
*(10.8) Andhi Janapsatya and Aleksandar Ignjatović and Sri Parameswaran [http://portal.acm.org/citation.cfm?id=1118443 A novel instruction scratchpad memory optimization method based on concomitance metric]. Asia and South Pacific Design Automation Conference. Pages: 612 - 617. 2006.
:-The University of New South Wales, Sydney, Australia
 
*(10.9) Stefan Steinke and Nils Grunwald and Lars Wehmeyer and Rajeshwari Banakar and M. Balakrishnan and Peter Marwedel [http://portal.acm.org/citation.cfm?id=581247 Reducing energy consumption by dynamic copying of instructions onto onchip memory]. International Symposium on Systems Synthesis. Pages: 213 - 218. 2002.
:-University of Dortmund, 44221 Dortmund, Germany
 
*(10.10) Manish Verma and Lars Wehmeyer and Peter Marwedel. [http://portal.acm.org/citation.cfm?id=1016748 Dynamic overlay of scratchpad memory for energy minimization]. International Conference on Hardware Software Codesign. Pages: 104 - 109. 2004.
:-University of Dortmund, Dortmund, Germany
 
=== Segment Prefetching ===
*[http://en.wikipedia.org/wiki/Branch_target_predictor Branch target prediction], should be similar to what we want to accomplish as opposed to branch prediction
 
=== IBM CBE Compilers (xlc/gcc) ===
*Overlay manager source code <<code>ovl_spu.S</code>> is located in <<code>spu-binutils-2.18.50-21.src.rpm: ld/emultempl/spu_ovl.S</code>>
*[http://publib.boulder.ibm.com/infocenter/systems/scope/syssw/index.jsp?topic=/eicct/prg/overlaycompileroption.html switches for automatic overlay generation]
:<code>--auto-overlay=link.script</code> outputs the generated overlay as a linker script and halts
*[http://publib.boulder.ibm.com/infocenter/systems/scope/syssw/index.jsp?topic=/eicct/prg/gnulinkdetails.html Using the GNU SPU linker for overlays]
*[http://www.loongson.cn/svn/toolchain-gs/branches/auto-vectorization/binutils-2.18/ld/emultempl/spu_ovl.S Overlay manager source code]
*[http://www.williamstein.org/home/kirkby/binutils-2.19.1/ld/emultempl/spu_ovl.S Overlay manager source code], different comments
*[http://cvs.opensolaris.org/source/xref/sfw/usr/src/cmd/binutils/binutils-2.19/ld/emultempl/spu_ovl.S Overlay manager source code], another version
*[http://binutils.sourcearchive.com/documentation/2.18.93.20081009/elf32-spu_8c-source.html elf32-spu.c]
 
 
<code>Last printed: 10.17</code>

Latest revision as of 09:21, 19 November 2009


Literature

-"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

Segment Prefetching

IBM CBE Compilers (xlc/gcc)

--auto-overlay=link.script outputs the generated overlay as a linker script and halts


Last printed: 10.17

Retrieved from "https://www.esoterum.org/mw/index.php?title=Code_Overlay&oldid=2431"