Partitioning streaming parallelism for multi-cores: A machine learning based approach

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn , Issue , 2010, Pages 307-318

  Wang, Zheng ^a   O'Boyle, Michael F P ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

compiler optimization; machine learning; partitioning streaming parallelism

Indexed keywords

ITERATIVE METHODS; LEARNING SYSTEMS; MACHINE LEARNING; PARALLEL ARCHITECTURES; PROGRAM COMPILERS;

COMPILER OPTIMIZATIONS; MODEL BASED APPROACH; MODERN APPLICATIONS; MULTI-CORE PROCESSOR; PARTITION STRUCTURES; PARTITIONING STREAMING PARALLELISM; STATE OF THE ART; STREAMING APPLICATIONS;

MULTICORE PROGRAMMING;

EID: 78149235736     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1854273.1854313     Document Type: Conference Paper

References (41)

1. F. Aleen, M. Sharif, and S. Pande. Input-driven dynamic execution prediction of streaming applications. In PPoPP, 2010.
2. K. Asanovic, R. Bodik, and J. Demmel et al. A view of the parallel computing landscape. Commun. ACM, 52(10), 2009.
3. G. Bikshandi, J. Guo, and D. Hoeflinger et al. Programming for parallelism and locality with hierarchically tiled arrays. In PPoPP, 2006.
4. C. M. Bishop. Pattern Recognition and Machine Learning. Springer, 2006.
5. T. N. Bui and C. Jones. Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett., 42(3), 1992.
6. S. Chellappa, F. Franchetti, and M. Püeschel. Computer generation of fast fourier transforms for the cell broadband engine. In ICS, 2009.
7. D. E. Culler, R. M. Karp, and D. Patterson et al. LogP: a practical model of parallel computation. Commun. ACM, 39(11), 1996.
8. W. C. Dan, W. yu Chen, and Parry Husbands et al. A performance analysis of the berkeley upc compiler. In ICS, 2003.
9. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification (2nd Edition). Wiley-Interscience, 2000.
10. M. I. Gordon, W. Thies, and S. Amarasinghe. Exploiting coarse-grained task, data, and pipeline parallelism in stream programs. In ASPLOS, 2006.
11. M. I. Gordon, W. Thies, and M. Karczmarek et al. A stream compiler for communication-exposed architectures. In ASPLOS, 2002.
12. H. Hofstee. Future microprocessors and off-chip sop interconnect. Advanced Packaging, IEEE Transactions on, 2004.
13. A. Hormati, Y. Choi, and M. Woh et al. MacroSS: Macro-simdization of streaming applications. In ASPLOS, 2010.
14. A. H. Hormati, Y. Choi, and M. Kudlur et al. Flextream: Adaptive compilation of streaming applications for heterogeneous architectures. In PACT, 2009.
15. K. Hoste and L. Eeckhout. COLE: compiler optimization level exploration. In CGO, 2008.
16. M. Kudlur and S. Mahlke. Orchestrating the execution of stream programs on multicore platforms. In PLDI, 2008.
17. M. Kulkarni, K. Pingali, and B. Walter et al. Optimistic parallelism requires abstractions. In PLDI, 2007.
18. Y. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv., 31(4), 1999.
19. E. A. Lee and D. G. Messerschmitt. Synchronous Data Flow. Proc. IEEE, 75(9), 1987.
20. S. Liao, Z. Du, and G. Wu et al. Data and computation transformations for brook streaming applications on multiprocessors. In CGO, 2006.
21. C. Luk, S. Hong, and H. Kim. Qilin: exploiting parallelism on heterogeneous multiprocessors with adaptive mapping. In MICRO, 2009.
22. S. Mark and A. Saman. Predicting unroll factors using supervised classification. In CGO, 2005.
23. E. Moss, P. Utgoff, and J. Cavazos et al. Learning to schedule straight-line code. In NIPS, 1997.
24. H. Munk, E. Ayguadé, and C. Bastoul et al. ACOTES Project: Advanced Compiler Technologies for Embedded Streaming. International Journal of Parallel Programming, 2010.
25. A. Navarro, R. Asenjo, and S. Tabik et al. Analytical modeling of pipeline parallelism. In PACT, 2009.
26. D. Pelleg and A. W. Moore. X-means: Extending K-means with Efficient Estimation of the Number of Clusters. In ICML, 2000.
27. L. Pouchet and C. Bastoul et al. Iterative Optimization in the Polyhedral Model: Part II, Multidimensional Time. In PLDI, 2008.
28. K. Ramamritham and J. A. Stankovic. Dynamic task scheduling in hard real-time distributed systems. IEEE Softw., 1(3), 1984.
29. V. A. Saraswat, V. Sarkar, and C. von Praun. X10: concurrent programming for modern architectures. In PPoPP, 2007.
30. V. Sarkar. Automatic partitioning of a program dependence graph into parallel tasks. IBM J. Res. Dev., 35(5-6), 1991.
31. G. Schwarz. Estimating the dimension of a model. Ann. Statist, 6(2), 1978.
32. T. Sherwood, E. Perelman, and G. Hamerly et al. Automatically characterizing large scale program behavior. In ASPLOS, 2002.
33. R. Stephens. A survey of stream processing. Acta Informatica, 34(7):491-541, 1997.
34. M. Stephenson, S. Amarasinghe, and M. Martin et al. Meta optimization: improving compiler heuristics with machine learning. SIGPLAN Not., 2003.
35. J. Subhlok, J. M. Stichnoth, and David R. O'hallaron et al. Exploiting task and data parallelism on a multicomputer. In PPoPP, 1993.
36. B. Thies, M. Karczmarek, and S. Amarasinghe. StreamIt: A language for streaming applications. In CC, 2001.
37. W. Thies. Language and Compiler Support for Stream Programs. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 2009.
38. G. Tournavitis, Z. Wang, and B. Franke et al. Towards a holistic approach to auto-parallelization - integrating profile-driven parallelism detection and machine-learning based mapping. In PLDI, 2009.
39. A. Udupa, R. Govindarajan, and M. J. Thazhuthaveetil. Software Pipelined Execution of Stream Programs on GPUs. In CGO, 2009.
40. L. Van Ertvelde and L. Eeckhout. Dispersing proprietary applications as benchmarks through code mutation. In ASPLOS, 2008.
41. Z. Wang and M. F. O'Boyle. Mapping parallelism to multi-cores: a machine learning based approach. In PPoPP, 2009.