Commutativity analysis for software parallelization: Letting program transformations see the big picture

ACM SIGPLAN Notices

Volumn 44, Issue 3, 2009, Pages 241-252

  Aleen, Farhana ^a   Clark, Nathan ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Automatic Software Parallelization; Commutative Functions; Random Interpretation

Indexed keywords

APPLICATION DOMAINS; AUTOMATIC PARALLELIZATION; AUTOMATIC SOFTWARE PARALLELIZATION; COMMUTATIVE FUNCTIONS; COMMUTATIVITY; COMPILE TIME; COMPILER ANALYSIS; MANY-CORE ARCHITECTURE; MEMORY LAYOUT; MULTI-THREADED APPLICATION; NEW APPROACHES; PARALLELIZATION; PROGRAM TRANSFORMATIONS; RANDOM INTERPRETATION; SOFTWARE DEVELOPER; SOFTWARE DEVELOPMENT; SOFTWARE ENGINEERS;

COMPUTER SOFTWARE; PROGRAM INTERPRETERS;

SOFTWARE ARCHITECTURE;

EID: 67650824956     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (25)

1. W. Blume et al. Parallel programming with Polaris. IEEE Computer, 29(12):78-82, Dec. 1996.
2. M. Bridges, N. Vachharajani, Y. Zhang, T. Jablin, and D. August. Revisiting the sequential programming model for multi-core. In Proc. of the 40th Annual International Symposium on Microarchitecture, pages 69-84, 2007.
3. M. K. Chen and K. Olukotun. The Jrpm system for dynamically parallelizing Java programs. In Proc. of the 30th Annual International Symposium on Computer Architecture, pages 434-446, 2003.
4. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4th ACM Symposium on Principles of Programming Languages, pages 234-252, 1977.
5. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, Oct. 1991.
6. Z.-H. Du et al. A cost-driven compilation framework for speculative parallelization of sequential programs. In Proc. of the SIGPLAN '04 Conference on Programming Language Design and Implementation, pages 71-81, 2004.
7. S. Gulwani. Program Analysis using Random Interpretation. PhD thesis, University of California Berkeley, 2005.
8. M. Hind. Pointer analysis: haven't we solved this problem yet? In Proc. of the 2001 ACM Workshop on Program Analysis For Software Tools and Engineering, pages 54-61, June 2001.
9. W. Hwu et al. Implicitly parallel programming models for thousand-core microprocessors. In Proc. of the 44th Design Automation Conference, pages 754-759, June 2007.
10. M. S. Lam and M. C. Rinard. Coarse-grain parallel programming in Jade. In Third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 94-105, 1991.
11. C. Lee, M. Potkonjak, and W. Mangione-Smith. MediaBench: A tool for evaluating and synthesizing multimedia and communications systems. In Proc. of the 30th Annual International Symposium on Microarchitecture, pages 330-335, 1997.
12. V. Menon, K. Pengali, and N. Mateev. Fractal symbolic analysis. ACM Transactions on Programming Languages and Systems, 25(6):776-813, Nov. 2003.
13. S. Moon, B. So, and M. W. Hall. Evaluating automatic parallelization in SUIF. Journal of Parallel and Distributed Computing, 11(1):36-49, 2000.
14. E. Nystrom, H.-S. Kim, and W. Hwu. Bottom-up and top-down context-sensitive summary-based pointer analysis. In Proc. of the 11th Static Analysis Symposium, pages 165-180, Aug. 2004.
15. M. Prabhu and K. Olukotun. Exposing speculative thread parallelism in SPEC2000. In Proc. of the 10th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 142-152, June 2005.
16. M. Rinard and P. Diniz. Commutativity analysis: A new analysis technique for parallelizing compilers. ACM Transactions on Programming Languages and Systems, 19(6):1-47, Nov. 1997.
17. M. C. Rinard. The Design, Implementation and Evaluation of Jade, a Portable, Implicitly Parallel Programming Language. PhD thesis, Stanford University, 1994.
18. S. Ryoo et al. Automatic discovery of coarse-grained parallelism in media applications. Transactions on High Performance Embedded Architectures and Compilers, 1(1):194-213, Jan. 2007.
19. J. Shewchuk. Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates. Journal on Discrete and Computational Geometry, 18(3):305-363, 1997.
20. J. G. Steffan and T. C. Mowry. The potential for using thread-level data speculation to facilitate automatic parallelization. In Proc. of the 4th International Symposium on High-Performance Computer Architecture, pages 2-13, 1998.
21. Trimaran. An infrastructure for research in ILP, 2000. http://www.trimaran.org/.
22. P. Wadler. Deforestation: Transforming programs to eliminate trees. In Proc. of the 1990 European Symposium on Programming, pages 344-358, 1990.
23. P. Wu and A. Fekete. An empirical study of commutativity in application code. In Proc. of the 2003 International Database Engineering and Applications Symposium, page 358, 2003.
24. K. Zee, V. Kuncak, and M. Rinard. Full functional verification of linked data structures. In Proc. of the SIGPLAN '08 Conference on Programming Language Design and Implementation, pages 349-361, 2008.
25. H. Zhong et al. Uncovering hidden loop level parallelism in sequential applications. In Proc. of the 14th International Symposium on High-Performance Computer Architecture, pages 290-301, 2008.