Automatic discovery of coarse-grained parallelism in media applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4050 LNCS, Issue , 2007, Pages 194-213

  Ryoo, Shane ^a   Ueng, Sain Zee ^a   Rodrigues, Christopher I ^a   Kidd, Robert E ^a   Frank, Matthew I ^a   Hwu, Wen Mei W ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COARSE-GRAINED PARALLELISM; PARALLEL PROGRAMMERS;

C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING; MICROPROCESSOR CHIPS; MOTION PICTURE EXPERTS GROUP STANDARDS; PROGRAM COMPILERS;

PARALLEL PROCESSING SYSTEMS;

EID: 34547311216     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71528-3_13     Document Type: Conference Paper

References (36)

1. Advanced Micro Devices. AMD Athlon 64 X2 dual-core product data sheet, May 2005.
2. ASTRÉE Static Analyzer, http://www.astree.ens.fr/.
3. W. Blume, R. Eigenmann, K. Faigin, J. Grout, J. Hoeflinger, D. Padua, P. Petersen, W. Pottenger, L. Rauchwerger, P. Tu, and S. Weatherford. Polaris: The next generation in parallelizing compilers. Technical Report 1375, University of Illinois at Urbanar-Champaign, 1994.
4. Mark Byler, James R. B. Davies, Christopher Huson, Bruce Leasure, and Michael Wolfe. Multiple version loops. In Proceedings of the 1987 International Conference on Parallel Processing, pages 312-318, 1987.
5. Cell Project at IBM Research, http://www.research.ibm.com/cell/.
6. Michael P. Gerlek, Eric Stoltz, and Michael Wolfe. Beyond induction variables: detecting and classifying sequences using a demand-driven SSA form. ACM Transactions on Programming Languages and Systems, 17(1):85-122, 1995.
7. R. Ghiya, D. M. Lavery, and D. C. Sehr. On the importance of points-to analysis and other memory disambiguation methods for C programs. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Design and Implementation, pages 47-58, 2001.
8. Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in c. In Symposium on Principles of Programming Languages, pages 1-15, 1996.
9. Rajiv Gupta, Santosh Pande, Kleanthis Psarris, and Vivek Sarkar. Compilation techniques for parallel systems. Parallel Computing, 25(13,14):1741-1783, 1999.
10. M. W. Hall, S. P. Amarasinghe, B. R. Murphy, S.-W. Liao, and M. S. Lam. Inter-procedural parallelization analysis in SUIF. ACM Transactions on Programming Languages and Systems, 27:662-731, 2005.
11. M. W. Hall, J. M. Anderson, S. P. Amarasinghe, B. R. Murphy, S.-W. Liao, E. Bugnion, and M. S. Lam. Maximizing multiprocessor performance with the SUIF compiler. IEEE Computer, 29(12):84-89, 1996.
12. W. H. Harrison. Compiler analysis of the value ranges for variables. IEEE Transactions on Software Engineering, 3(3):243-250, May 1977.
13. R. Hasti and S. Horwitz. Using static single assignment form to improve flowinsensitive pointer analysis. In Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation, pages 97-105, June 1998.
14. L. Hendren, J. Hummel, and A. Nicolau. Abstractions for recursive pointer data structures: Improving the analysis and transformation of imperative programs. In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, pages 249-260, June 1992.
15. L. J. Hendren and A. Nicolau. Parallelizing programs with recursive data structures. IEEE Transactions on Parallel and Distributed System, 1(1):35-47, January 1990.
16. M. Hind. Pointer analysis: Haven't we solved this problem yet? In Proceedings of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pages 54-61, 2001.
17. M. Hind and A. Pioli. Evaluating the effectiveness of pointer alias analyses. Technical Report RC21510, IBM T. J. Watson Research Center, March 1999.
18. Independent JPEG Group, coderules.doc. Text file in zipped archive, 1998. ftp://ftp.uu.net/graphics/jpeg/jpegsrc.v6b.tar.gz.
19. Intel Network Processors. http://www.intel.com/design/network/products/ npfamily/.
20. Intel Pentium D Processor. http://www.intel.com/products/processor/ pentium_D/index.htm.
21. H. Johnson. Data flow analysis for 'intractable' imbedded system software. In Proceedings of the 1986 SIGPLAN Symposium on Compiler Construction, pages 109-117, 1986.
22. K. Kennedy and R. Allen. Optimizing Compilers for Modern Architectures: A Dependence-based Approach. Morgan Kaufmann Publishers, San Francisco, CA, 2002.
23. K. Kennedy, K. S. McKinley, and C. Tseng. Interactive parallel programming using the ParaScope editor. IEEE Transactions on Parallel and Distributed Systems, 2:329-341, 1991.
24. X. Kong, D. Klappholz, and K. Psarris. The I-Test: An improved dependence test for automatic parallelization and vectorization. IEEE Transactions on Parallel and Distributed Systems, Special Issue on Parallel Languages and Compilers, 2(3):342-349, July 1991.
25. MPEG Industry Forum, http://www.mpegif.org/.
26. E. M. Nystrom. FULCRA Pointer Analysis Framework. PhD thesis, University of Illinois at Urbana-Champaign, 2005.
27. E. M. Nystrom, H.-S. Kim, and W. W. Hwu. Importance of heap specialization in pointer analysis. In Proceedings of ACM-SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pages 43-48, June 2004.
28. Y. Paek, J. Hoeflinger, and D. Padua. Efficient and precise array access analysis. ACM Transactions on Programming Languages and Systems, 24(1):65-109, 2000.
29. James Player. An evaluation of low-overhead partial flow-sensitivity. Master's thesis, Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, 2005.
30. Power Mac G5. http://www.apple.com/powermac/.
31. W. Pugh. The Omega Test: A fast and practical integer programming algorithm for dependence analysis. In Proceedings of Supercomputing 1991, pages 4-13, November 1991.
32. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. In Proceedings of the ACM Symposium on Programming Languages, pages 16-31, Januaxy 1996.
33. E. Salami and M. Valero. Dynamic memory interval test vs. interprocedural pointer analysis in multimedia applications. ACM Transactions on Architecture and Code Optimization, 2(2): 199-219, 2005.
34. V. Sarkar and J. Hennessy. Compile-time partitioning and scheduling of parallel programs. In Proceedings of the ACM SIGPLAN 86 Symposium on Compiler Construction, pages 17-26, June 1986.
35. Peng Tu and David Padua. Gated SSA-based demand-driven symbolic analysis for parallelizing compilers. In Proceedings of the 1995 International Conference on Supercomputing, pages 414-423, 1995.
36. M. Voss and R. Eigenmann. Dynamically adaptive parallel programs. In Proceedings of the International Symposium on High Performance Computing, pages 109-120, May 1999.