Deep jam: Conversion of coarse-grain parallelism to instruction-level and vector parallelism for irregular applications

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn 2005, Issue , 2005, Pages 291-300

  Carribault, Patrick ^a,b,c   Cohen, Albert ^c   Jalby, William ^b  

^a Bull   (France)

^b LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; DATA TRANSFER; OPTIMIZATION; PARALLEL ALGORITHMS; STORAGE ALLOCATION (COMPUTER);

BACK-END OPTIMIZATIONS; DEEP JAM ALGORITHM; IRREGULAR CONTROL; STATE-OF-THE-ART LOOP TRANSFORMATIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 33746733539     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.2005.16     Document Type: Conference Paper

References (51)

1. R. Allen and K. Kennedy. Optimizing Compilers for Modern Architectures. Morgan and Kaufman, 2002.
2. D. I. August, D. A. Connors, S. A. Mahlke, J. W. Sias, K. M. Crozier, B.-C. Cheng, P. R. Eaton, Q. B. Olaniran, and W.-M. Hwu. Integrated predicated and speculative execution in the IMPACT EPIC architecture. In Proc. Intl. Symp. on Computer Architecture (ISCA '98), July 1998.
3. 25 ACM Symp. on Principles of Programming Languages (PoPL'98), pages 98-106, San Diego, California, Jan. 1998.
4. E. Biham, R. Chen, A. Joux, P. Carribault, W. Jalby, and C. Lemuet. Collisions of SHA-0 and reduced SHA-1. In EUROCRYPT'0.5. Springer-Verlag, 2005.
5. W. Blume, R. Eigenmann, K. Faigin, J. Grout, J. Hoefinger, D. Padua, P. Petersen, W. Pottenger, L. Rauchwerger, P. Tu, and S. Weatherford. Parallel programming with Polaris. IEEE Computer, 29(12):78-82, Dec. 1996.
6. B. Calder, G. Reinman, and D. M. Tullsen. Selective value prediction. In Proc. Intl. Symp. on Computer Architecture (ISCA'99), pages 64-74, 1999.
7. S. Carr, C. Ding, and P. Sweany. Improving software pipelining with unroll-and-jam. In Proceedings of the 29th Hawaii Intl. Conf. on System Sciences (HICSS'96) Volume 1: Software Technology and Architecture. IEEE Computer Society, 1996.
8. P. Carribault, C. Lemuel, J.-T. Acquaviva, A. Cohen, and W. Jalby. Branch strategies to optimize decision trees for wide-issue architectures. In Workshop on Languages and Compilers for Parallel Computing (LCPC'04), LNCS, West Lafayette, Indiana, Sept. 2004.
9. A. Cohen. Program Analysis and Transformation: from the Polytope Model to Formal Languages. PhD thesis, Université de Versailles, France, Dec. 1999.
10. thWorkshop on Languages and Compilers for Parallel Computing, number 1656 in LNCS, pages 338-352, Chapel Hill, North Carolina, Aug. 1998. Springer-Verlag.
11. K. D. Cooper, D. Subramanian, and L. Torczon. Adaptive optimizing compilers for the 21st century. J. of Supercomputing, 2002.
12. A. Cristal, O. J. Santana, M. Valero, and J. F. Martinz. Toward kilo-instruction processors. ACM Trans. on Architecture and Code Optimization, 1(4):389-417, 2004.
13. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Effi ciently computing static single assignment form and the control dependence graph. ACM Trans. on Programming Languages and Systems, 13(4):451-490, Oct. 1991.
14. A. G. Dean and J. P. Shen. Techniques for software thread integration in real-time embedded systems. In IEEE Real-Time Systems Symposium (RTSS'98), Madrid, Spain, Dec. 1998.
15. P.Feautrier. Array expansion. In ACM Int. Conf. on Supercomputing, pages 429-441, St. Malo, France, July 1988.
16. J. A. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Trans. on Computers, C-30, July 1981.
17. J. González and A. Gonzalez. The potential of data value speculation to boost ILP. In ACM Int. Conf. on Supercomputing (ICS'98), pages 21-28, 1998.
18. M. Griebl and J.-F. Collard. Generation of synchronous code for automatic parallelization of while loops. In S. Haridi, K. All, and P. Magnusson, editors, Eum-Par'95, volume 966 of LNCS, pages 315-326. Springer-Verlag, 1995.
19. H. Hyyrö and G. Navarro. Faster bit-parallel approximate string matching. In Proc. Symp. on Combinatorial Pattern Matching (CPM'02), number 2373 in LNCS, pages 203-22. Springer-Verlag, 2002.
20. A. Joux. Collisions in SHA-0. CRYPTO Rump Session, 2004.
21. K. Kennedy and K. McKinley. Maximizing loop parallelism and improving data locality via loop fusion and distribution. In Languages and Compilers for Parallel Computing, pages 301-320, Portland, 1993.
22. T. Kisuki, P. Knijnenburg, K. Gallivan, and M. O'Boyle. The effect of cache models on iterative compilation for combined tiling and unrolling. In Parallel Architectures and Compilation Techniques (PACT'00). IEEE Computer Society, Oct. 2001.
23. T. Kisuki, P. Knijnenburg, M. O'Boyle, and H. Wijshoff. Iterative compilation in program optimization. In Proc. CPC'10 (Compilers for Parallel Computers), pages 35-44, 2000.
24. thACM Symp. on Principles of Programming Languages, pages 107-120, San Diego, CA, Jan. 1998.
25. M. Lom. Software pipelining: an effective scheduling technique for vliw machines. In ACM Symp. on Programming Language Design and Implementation (PLDI'88), pages 318-328, Atlanta, GA, July 1988.
26. thACM Symp. on Principles of Programming Languages, pages 2-15, Charleston, South Carolina, Jan. 1993.
27. A. Moshovos, P. Banerjee, S. Hauck, and Z. A. Ye. Chimaera: A high-performance architecture with a tightly-coupled reconfigurable functional unit. In Proc. Intl. Symp. on Computer Architecture (ISCA '04), Vancouver, BC, jun 2000.
28. J. Moura, M. Püschel, J. Dongarra, and D. Padua, editors. Proceedings of the IEEE. Special Issue on Program Generation, Optimization, and Platform Adaptation, volume 93. IEEE Computer Society, Jan. 2005.
29. S. S. Muchnick. Advanced Compiler Design & Implementation. Morgan Kaufmann, 1997.
30. G. Myers. A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. of the ACM, 46(3):395-415, 1999.
31. G. Navarro and M. Raffinot. Flexible Pattern Matching in Strings. Cambridge University Press, 2002.
32. N. I. of Standards and Technologies, editors. Secure Hash Standard, volume FIPS-180. Inforrnation Processing Standards Publication, may 1993.
33. J. Oplinger, D. Heine, and M. S. Lam. In search of speculative thread-level parallelism. In Parallel Architectures and Compilation Techniques (PACT'99), pages 303-313, Newport Beach, CA, Oct. 1999.
34. G.-R. Perrin and A. Darte, editors. The Data Parallel Programming Model: Foundations, HPF Realization, and Scientif c Applications. Number 1132 in LNCS. Springer-Verlag, 1996.
35. S. E. Raasch, N. L. Binkert, and S. K. Reinhardt. A scalable instruction queue design using dependence chains. In Proc. Intl. Symp. on Computer Architecture (ISCA'02), Anchorage, AK, May 2002.
36. L. Rauchwerger and D. Padua. The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. IEEE Transactions on Parallel and Distributed Systems, Special Issue on Compilers and Languages for Parallel and Distributed Computers, 10(2): 160-180, 1999.
37. H. Rong, Z. Tang, R. Govindarajan, A. Douillet, and G. R. Gao. Single-dimension software-pipelining for multi-dimensional loops. In ACM Conf. on Code Generation and Optimization (CGO'04), pages 163-174, Mar. 2004.
38. S. Rus, D. Zhang, and L. Rauchwerger. The value evolution graph and its use in memory reference analysis. In Parallel Architectures and Compilation Techniques (PACT'04), Juan-les-Pins, France, Oct. 2004.
39. K. Sankaralingam, R. Nagarajan, H. Liu, C. Kim, J. Huh, D. Burger, S. W. Keckler, and C. R. Moore. Exploiting ILP, TLP, and DLP with the polymorphous TRIPS architecture. In Proc. Intl. Symp. on Computer Architecture (ISCA W), San Diego, CA, June 2003.
40. R. Schreiber, S. Aditya, B. Rau, V. Kathail, S. Mahlke, S. Abraham, and G. Snider. High-level synthesis of nonprogrammable hardware accelerators. Technical report, Hewlett-Packard, May 2000.
41. Silicon Hive web site, http://www.silicon-hive.com.
42. M. D. Smith. Overcoming the challenges to feedback-directed optimization. In ACM SIGPLAN Workshop on Dynamic and Adaptive Compilation and Optimization, pages 1-11, 2000. (Keynote Talk).
43. B. So, M. W. Hall, and P. Diniz. A compiler approach to design space exploration in fpga-based systems, In ACM Symp. on Programming Language Design and Implementation (PLDI'02), June 2002.
44. W. So and A. G. Dean. Procedure cloning and integration for converting parallelism from coarse to fi ne grain. In 7th Annual Workshop on Interaction between Compilers and Computer Architectures (INTERACT-7), 2003.
45. W. So and A. G. Dean. Complementing software pipelining with software thread integration. In ACM Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'05), 2005.
46. M. B. Taylor, J. Kim, J. Miller, D. Wentzlaff, F. Ghodrat, B. Greenwald, H. Hoffman, J.-W. Lee, P. Johnson, W. Lee, A. Ma, A. Saraf, M. Seneski, N. Shnidman, V. Strumpen, M. Frank, S. Amarasinghe, and A. Agarwal. The RAW microprocessor: A computational fabric for software circuits and general purpose programs. IEEE Micro, 2002.
47. th Workshop on Languages and Compilers for Parallel Computing, number 768 in LNCS, pages 500-521, Portland, Oregon, Aug. 1993.
48. D. Tullsen, S. Eggers, and H. Levy. Simultaneous multithreading: Maximizing on-chip parallelism. In Proc. Intl. Symp. on Computer Architecture. (ISCA'95), jun 1995.
49. J. Wang and G. Gao. Pipelining-dovetailing: a transformation to enhance software pipelining for nested loops. In Intl. Conf on Compiler Construction(CC'96), volume 1060 of LNCS, pages 1-17, Linköping, Sweden, Apr. 1996. Springer-Verlag.
50. S. Winkel. Exploring the performance potential of itanium processors with ilp-based scheduling. In IEEE/ACM International Symposium on Code Generation and Optimization (CGO'04), Palo Alto, March 2004.
51. S. Yehia and O. Temam. From sequences of dependent instructions to functions: An approach for improving performance without ILP or speculation. In Proc. Intl. Symp. on Computer Architecture (ISCA'04), Munich, Germany, June 2004.