Towards a holistic approach to auto-parallelization integrating profile-driven parallelism detection and machine-learning based mapping

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2009, Pages 177-187

  Tournavitis, Georgios ^a   Wang, Zheng ^a   Franke, Björn ^a   O'Boyle, Michael F P ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Auto parallelization; Machine learning based parallelism mapping; OpenMP; Profile driven parallelism detection

Indexed keywords

EXPERT PROGRAMMERS; HOLISTIC APPROACH; INTEGRATED APPROACH; MACHINE-LEARNING; MACHINE-LEARNING BASED PARALLELISM MAPPING; MULTI CORE; PARALLEL BENCHMARKS; PARALLEL CODE; PARALLELIZATION STRATEGIES; PARALLELIZATIONS; PARALLELIZING COMPILER; PERFORMANCE IMPROVEMENTS; PERFORMANCE LEVEL; TARGET ARCHITECTURES;

C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; EDUCATION; LINGUISTICS; PARALLEL ARCHITECTURES; PROGRAM COMPILERS; SHAPE MEMORY EFFECT;

MAPPING;

EID: 70450278773     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542476.1542496     Document Type: Conference Paper

References (47)

1. H. P. Hofstee. Future microprocessors and off-chip SOP interconnect. IEEE Trans. on Advanced Packaging, 27(2), May 2004.
2. L. Lamport. The parallel execution of DO loops. Communications of ACM, 17(2), 1974.
3. M. Burke and R. Cytron. Interprocedural dependence analysis and parallelization. PLDI, 1986.
4. R. Allen and K. Kennedy. Optimizing Compilers for Modern Architectures: A Dependence-Based Approach. Morgan Kaufmann, 2002.
5. A. W. Lim and M. S. Lam. Maximizing parallelism and minimizing synchronization with affine transforms. Parallel Computing, ACM, 1997.
6. D. A. Padua, R. Eigenmann, et al. Polaris: A new-generation parallelizing compiler for MPPs. Technical report, In CSRD No. 1306. UIUC, 1993.
7. M. W. Hall, J. M. Anderson, et al. Maximizing multiprocessor performance with the SUIF compiler. Computer, 29(12), 1996.
8. Open64. http://www.open64.net.
9. F. Matteo, C. Leiserson, and K. Randall. The implementation of the Cilk-5 multithreaded language. PLDI, 1998.
10. M. Gordon, W. Thies, M. Karczmarek, et al. A stream compiler for communication-exposed architectures. ASPLOS, 2002.
11. P. Husbands Parry, C. Iancu, and K. Yelick. A performance analysis of the Berkeley UPC compiler. SC, 2003.
12. V. A. Saraswat, V. Sarkar, and C von. Praun. X10: Concurrent programming for modern architectures. PPoPP, 2007.
13. L. Shih-Wei, D. Amer, et al. SUIF Explorer: An interactive and interprocedural parallelizer. SIGPLAN Not., 34(8), 1999.
14. M. Kulkarni, K. Pingali, B. Walter, et al. Optimistic parallelism requires abstractions. PLDI'07, 2007.
15. L. Rauchwerger, F. Arzu, and K. Ouchi. Standard Templates Adaptive Parallel Library. Inter. Workshop LCR, 1998.
16. Jia Guo, Ganesh Bikshandi, et al. Hierarchically tiled arrays for parallelism and locality. IPDPS, 2006.
17. F. Irigoin, P. Jouvelot, and R. Triolet. Semantical interprocedural parallelization: an overview of the PIPS project. ICS 1991
18. K. Kennedy, K. S. McKinley, and C. W. Tseng. Interactive parallel programming using the Parascope editor. IEEE TPDS, 2(3), 1991.
19. T. Brandes, S. Chaumette, M. C. Counilh et al. HPFIT: a set of integrated tools for the parallelization of applications using high performance Fortran. part I: HPFIT and the Transtool environment. Parallel Comput., 23(1-2), 1997.
20. M. Ishihara, H. Honda, and M. Sato. Development and implementation of an interactive parallelization assistance tool for OpenMP: iPat/OMP. IEICE Trans. Inf. Syst., E89-D(2), 2006.
21. S. Rul, H. Vandierendonck, and K. De Bosschere. A dynamic analysis tool for finding coarse-grain parallelism. In HiPEAC Industrial Workshop, 2008.
22. W. M. Pottenger. Induction variable substitution and reduction recognition in the Polaris parallelizing compiler. Technical Report, UIUC, 1994.
23. M. O'Boyle and E. Stöhr. Compile time barrier synchronization minimization. IEEE TPDS, 13(6), 2002.
24. E. B. Bernhard, M. G. Isabelle, and N. V. Vladimir. A training algorithm for optimal margin classifiers. Workshop on Computational Learning Theory, 1992.
25. H. Ziegler and M. Hall. Evaluating heuristics in automatically mapping multi-loop applications to FPGAs. FPGA, 2005.
26. D. H. Bailey, E. Barszcz, et al. The NAS parallel benchmarks. The International Journal of Supercomputer Applications, 5(3), 1991.
27. R. E. Grant and A. Afsahi. A Comprehensive Analysis of OpenMP Applications on Dual-Core Intel Xeon SMPs. IPDPS, 2007.
28. NAS Parallel Benchmarks 2.3, OpenMP C version. http://phase.hpcc.jp/Omni/benchmarks/NPB/index.html.
29. V. Aslot, M. Domeika, et al. SPEComp: A New Benchmark Suite for Measuring Parallel Computer Performance. LNCS, 2001.
30. S. Wallace, B. Calder, and D. M. Tullsen. Threaded multiple path execution. ISCA, 1998.
31. J. Dou and M. Cintra. Compiler estimation of load imbalance overhead in speculative parallelization. PACT, 2004.
32. R. Ramaseshan and F. Mueller. Toward thread-level speculation for coarse-grained parallelism of regular access patterns. MULTIPROG, 2008.
33. M. Bridges, N. Vachharajani, et al. Revisiting the sequential programming model for multi-core. MICRO, 2007.
34. S. Rus, M. Pennings, and L. Rauchwerger. Sensitivity analysis for automatic parallelization on multi-cores, 2007. ICS, 2007
35. P. Peterson and D. Padua. Dynamic dependence analysis: A novel method for data dependence evaluation. LCPC, 1992.
36. M. Chen and K. Olukotun. The JRPM system for dynamically parallelizing Java programs. ISCA, 2003.
37. S. Rus and L. Rauchwerger. Hybrid dependence analysis for automatic parallelization. Technical Report, Dept. of CS, Texas A&M U., 2005.
38. C. Ding, X. Shen, et al. Software behavior oriented parallelization. PLDI, 2007.
39. W. Thies, V. Chandrasekhar, and S. Amarasinghe. A practical approach to exploiting coarse-grained pipeline parallelism in C programs. MICRO, 2007.
40. J. Ramanujam and P. Sadayappan. A methodology for parallelizing programs for multicomputers and complex memory multiprocessors. SC, 1989.
41. C. Liao and B. Chapman. A compile-time cost model for OpenMP. IPDPS, 2007.
42. J. Corbalan, X. Martorell, and J. Labarta. Performance-driven processor allocation. IEEE TPDS, 16(7), 2005.
43. Y. Zhang and M. Voss. Runtime empirical selection of loop schedulers on Hyperthreaded SMPs. IPDPS, 2005.
44. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8), 1990.
45. K. Cooper, P. Schielke, and D. Subramanian. Optimizing for reduced code space using genetic algorithms. LCTES, 1999.
46. A. Monsifrot, F. Bodin, and R. Quiniou. A machine learning approach to automatic production of compiler heuristics. Artificial Intelligence: Methodology, Systems, Applications, 2002.
47. L.N. Pouchet, C. Bastoul, A. Cohen, and J. Cavazos. Iterative optimization in the polyhedral model: part II, multidimensional time. PLDI, 2008.