UFS: A global trade-off strategy for loop unrolling for VLIW architectures

Concurrency and Computation: Practice and Experience

Volumn 18, Issue 11, 2006, Pages 1413-1434

  Heydemann, K ^a   Bodin, F ^a   Knijnenburg, P M W ^b   Morin, L ^a  

^a CAMPUS DE BEAULIEU   (France)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Code optimization; Feedback directed compilation; Instruction level parallelism; Iterative compilation; Loop unrolling

Indexed keywords

CLASSIFICATION (OF INFORMATION); CODES (SYMBOLS); COST EFFECTIVENESS; EMBEDDED SYSTEMS; FEEDBACK; ITERATIVE METHODS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

FEEDBACK DIRECTED COMPILATION; INSTRUCTION LEVEL PARALLELISM; ITERATIVE COMPILATION; LOOP UNROLLING;

VERY LONG INSTRUCTION WORD ARCHITECTURE;

EID: 33748470947     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1014     Document Type: Conference Paper

References (41)

1. TriMedia. http://www.semiconductors.philips.com [September 2005].
2. Carmel DSP. http://www.carmeldsp.com [November 2003].
3. Texas Instruments, http://dspvillage.ti.com [September 2005].
4. Equator, http://www.equator.com [September 2005].
5. Faraboschi P, Fisher J, Brown G, Desoli G, Homewood F. Lx: A technology platform for customizable VLIW embedded processing. Proceedings of the International Symposium on Computer Architecture, Vancouver, BC, 2000. ACM Press: New York, 2000.
6. STMicroelectronics. http://eu.st.com [September 2005].
7. Hwu W-M et al. The superblock: An effective technique for VLIW and superscalar compilation. The Journal of Supercomputing 1993; 7(1-2):229-248.
8. Davidson JW, Jinturkar S. Aggressive loop unrolling in a retargetable optimizing compiler. Proceedings of Compiler Construction (Lecture Notes in Computer Science, vol. 1060). Springer: Berlin, 1996; 59-73.
9. Kisuki T, Knijnenburg PMW, O'Boyle MFP, Bodin F. A feasibility study in iterative compilation. Proceedings of ISHPC (Lecture Notes in Computer Science, vol. 1615). Springer: Berlin, 1999; 121-132.
10. Kisuki T, Knijnenburg PMW, O'Boyle MFP. Combining selection of tile size and unroll factors using iterative compilation. Proceedings of Parallel Architectures and Compilation Techniques, 2000; 237-246.
11. Cockx AJ. Whole program compilation for embedded software: The ADSL experiment. Proceedings of the International Conference on Hardware Software Codesign, Copenhagen, 2001. ACM Press: New York, 2001; 214-218.
12. Jacome M, de Veciana G. Design challenges for new application specific processors. IEEE Design and Test of Computers 2000; 17(2):40-50.
13. Leupers R. Compiler optimization for media processors. Business and Work in the Information Society: New Technologies and Applications, Roger J-Y, Stanford-Smith B, Kidd PT (eds.). IOS Press: Amsterdam, 1999.
14. Leupers R. Exploiting conditional instructions in code generation for embedded VLIW processors. Proceedings of Design Automation and Test in Europe, Munich, Germany, 1999. IEEE Computer Society Press: Los Alamitos, CA, 1999.
15. Marwedel P, Steinke S, Wehmeyer L. Compilation techniques for energy-, code-size-, and run-time-efficient embedded software. Proceedings of the International Workshop on Advanced Compiler Techniques for High Performance and Embedded Processors, Bucharest, 2001.
16. Smith MD. Overcoming the challenges to feedback-directed optimization. Proceedings of the ACM SIGPLAN Workshop on Dynamic and Adaptive Compilation and Optimization (Dynamo'00), Boston, MA, 2000. ACM Press: New York, 2000.
17. Bodin F, Kisuki T, Knijnenburg PMW, O'Boyle MFP, Rohou E. Iterative compilation in a non-linear optimisation space. Proceedings of the Profile and Feedback-Directed Compilation, Paris, France, 1998. ACM Press: New York, 1998.
18. Zhou H, Conte TM. Code size efficiency in global scheduling for VLIW/EPIC style embedded processors. Proceedings of the Interaction between Compilers and Computer Architectures (INTERACT-6), Cambridge, MA, 2002. IEEE Computer Society Press: Los Alamitos, CA, 2002.
19. Koseki A, Komastu H, Fukazawa Y. A method for estimating optimal loop unrolling times for nested loops. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'97), Taipei, Taiwan, 1997. IEEE Computer Society Press: Los Alamitos, CA, 1997; 376-382.
20. Sarkar V. Optimized unrolling of nested loops. International Journal Parallel Programing 2001; 29(5):345-581.
21. Kolson DJ, Nicolau A, Dutt N, Kennedy K. Optimal register assignment to loops for embedded code generation. ACM Transactions on Design Automation of Electronic Systems 1996; 1(2):251-279.
22. Bodin F, Chamski Z, Eisenbeis C, Rohou E, Seznec A. GCDS: A compiler strategy for trading code size against performance in embedded applications. Technical Report RR-3346, INRIA, Institut National de Recherche en Informatique et en Automatique, January 1998.
23. Amdahl GM. Validity of the single-processor approach to achieving large scale computing capabilities. Proceedings of the AFIPS Conference (Lecture Notes in Computer Science, vol. 30). Springer: Berlin, 1967; 483-485.
24. Schrijver A. Karmarkar's polynomial-time algorithm for linear programming. Theory of Linear and Integer Programming. Wiley: New York, 1986; 190-194.
25. GNU C Compiler, http://gcc.gnu.org [September 2005].
26. Phillips, http://www.semiconductors.philips.com/acrobat/literature/9397/ 75006255.pdf [November 2003].
27. Sage++ Project, http://www.extreme.indiana.edu/sage/ [September 2005].
28. Salto Project. http://www.irisa.fr/caps/projects/Salto [September 2005].
29. lp_solve3.0. ftp://ftp.ics.ele.tue.nl/pub/lp.solve/ [September 2005].
30. Djabelkhir A, Seznec A. Characterization of embedded applications for decoupled processor architecture. Proceedings of the IEEE 6th Annual Workshop on Workload Characterization, Austin, TX, October 2003. IEEE Computer Society Press: Los Alamitos, CA, 2003.
31. Scott J, Lee LH, Arenas J, Moyer W. Designing the low-power M.CORE architecture. Proceedings of the Power Driven Microarchitecture Workshop at ISCA98, Barcelona, Spain, June 1998.
32. MPEG2. http://www.mpeg.org/MPEG/MSSG/ [September 2005].
33. H263. http://spmg.ece.ubc.ca/h263plus/h263plus.html [November 2003].
34. Guthaus MR, Ringenberg JS, Ernst D, Austin TM, Mudge T, Brown RB. MiBench: A free, commercially representative embedded benchmark suite. Proceedings of the Workshop on Workload Characterization, Austin, TX, 2001. IEEE Computer Society Press: Los Alamitos, CA, 2001.
35. Lee C. UTDSP Benchmark suite, Canada, 1992.
36. O'Boyle MFP, Nisbet A. Shallow: A mapping study. Technical Report, Department of Computer Science, University of Manchester, 1992.
37. Hwu W-M, Chang PP. Achieving high instruction cache performance with an optimizing compiler. Proceedings of the International Symposium on Computer Architecture, Jerusalem, Israel, 1989. ACM Press: New York, 1989; 242-251.
38. Hashemi AH, Kaeli DR, Calder B. Efficient procedure mapping using cache line coloring. ACM SIGPLAN Notices 1997; 32(5):171-182.
39. McFarling S. Program optimization for instruction caches. Proceedings of the Architectural Support for Programming Languages and Operating Systems (ASPLOS III), Boston, MA, 1989. ACM Press: New York, 1989; 183-191.
40. Wolf ME, Maydan DE, Chen DK. Combining loop transformations considering caches and scheduling. International Journal of Parallel Programming 1998; 26(4):479-503.
41. McFarling S. Procedure merging with instruction caches. Proceedings of the Programming Language Design and Implementation, Toronto, ON, 1991. ACM Press: New York, 1991; 71-79.