Structure-driven optimizations for amorphous data-parallel programs

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2010, Pages 3-14

  Méndez Lojo, Mario ^a   Nguyen, Donald ^b   Prountzos, Dimitrios ^b   Sui, Xin ^b   Hassaan, M Amber ^c   Kulkarni, Milind ^d   Burtscher, Martin ^a   Pingali, Keshav ^a,b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b University of Texas at Austin   (United States)

^c The University of Texas at Austin   (United States)

^d PURDUE UNIVERSITY   (United States)

Author keywords

Amorphous data parallelism; Cautious operator implementations; Irregular programs; Iteration coalescing; One shot optimization; Optimistic parallelization; Synchronization overheads

Indexed keywords

ALGORITHMIC STRUCTURE; AMORPHOUS DATA-PARALLELISM; AS GRAPH; DATA PARALLEL; DATA PARALLELISM; IRREGULAR PROGRAMS; PARALLEL EXECUTIONS; PARALLELIZATIONS; PARALLELIZING; POINTER-BASED DATA STRUCTURES; SPECULATIVE EXECUTION;

ALGORITHMS; DATA STRUCTURES; FLOCCULATION; MATHEMATICAL OPERATORS; PARALLEL ARCHITECTURES; SHAPE OPTIMIZATION; STRUCTURAL OPTIMIZATION;

PARALLEL PROGRAMMING;

EID: 77749304561     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1693453.1693457     Document Type: Conference Paper

References (26)

1. Daniel K. Blandford, Guy E. Blelloch, and Clemens Kadow. Engineering a compact parallel Delaunay algorithm in 3D. In SCG '06: 22nd Symposium on Computational Geometry, pages 292-300, 2006.
2. A. Braunstein, M. Mèzard, and R. Zecchina. Survey propagation: An algorithm for satisfiability. Random Structures and Algorithms, 27(2):201-226, 2005.
3. Sigmund Cherem, Trishul Chilimbi, and Sumit Gulwani. Inferring locks for atomic sections. In PLDI '08, pages 304-315, 2008.
4. Andrey N. Chernikov and Nikos P. Chrisochoides. Three-dimensional Delaunay refinement for multi-core processors. In ICS '08, 2008.
5. Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein, editors. Introduction to Algorithms. MIT Press, 2001.
6. David Eppstein. Spanning trees and spanners. In J. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425-461. Elsevier, 1999.
7. Paul Feautrier. Some efficient solutions to the affine scheduling problem: One dimensional time. International Journal of Parallel Programming, October 1992.
8. Andrew V. Goldberg and Robert E. Tarjan. A new approach to the maximum-flow problem. J. ACM, 35(4):921-940, 1988.
9. Leonidas J. Guibas, Donald E. Knuth, and Micha Sharir. Randomized incremental construction of delaunay and voronoi diagrams. Algorithmica, 7(1):381-413, December 1992.
10. David R. Jefferson. Virtual time. ACM Trans. Program. Lang. Syst., 7(3):404-425, 1985.
11. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48(1):96-129, 1998.
12. M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and L. P. Chew. Optimistic parallelism requires abstractions. SIGPLAN Not. (Proceedings of PLDI 2007), 42(6):211-222, 2007.
13. Milind Kulkarni, Martin Burtscher, Calin Casçaval, and Keshav Pingali. Lonestar: A suite of parallel irregular programs. In ISPASS '09: IEEE International Symposium on Performance Analysis of Systems and Software, 2009.
14. Milind Kulkarni, Martin Burtscher, Rajasekhar Inkulu, Keshav Pingali, and Calin Casçaval. How much parallelism is there in irregular applications? In PPoPP '09, pages 3-14, 2009.
15. Milind Kulkarni, Keshav Pingali, Ganesh Ramanarayanan, BruceWalter, Kavita Bala, and L. Paul Chew. Optimistic parallelism benefits from data partitioning. SIGARCH Comput. Archit. News, 36(1):233-243, 2008.
16. Roberto Lubllinerman, Swarat Chaudhuri, and Pavol Cerny. Parallel programming with object assemblies. In OOPSLA, 2009.
17. Timothy Mattson, Beverly Sanders, and Berna Massingill. Patterns for Parallel Programming. Addison-Wesley Publishers, 2004.
18. Bill McCloskey, Feng Zhou, David Gay, and Eric Brewer. Autolocker: synchronization inference for atomic sections. In POPL '06, pages 346-358, 2006.
19. J. Eliot B. Moss and Antony L. Hosking. Nested transactional memory: model and architecture sketches. Sci. Comput. Program., 63(2):186-201, 2006.
20. Nathaniel Nystrom, Michael R. Clarkson, and Andrew C. Myers. Polyglot: An extensible compiler framework for java. In CC'03, pages 138-152. Springer-Verlag, 2003.
21. http://www.openmp.org/.
22. D. Patterson, K. Keutzer, K. Asanovica, K. Yelick, and R. Bodik. Berkeley dwarfs. http://view.eecs.berkeley.edu/.
23. C. D. Polychronopoulos and D. J. Kuck. Guided self-scheduling: A practical scheduling scheme for parallel supercomputers. IEEE Trans. Comput., 36(12):1425-1439, 1987.
24. Bratin Saha, Ali-Reza Adl-Tabatabai, Richard L. Hudson, Chi Cao Minh, and Benjamin Hertzberg. McRT-STM: a high performance software transactional memory system for a multi-core runtime. In PPoPP '06, pages 187-197, 2006.
25. Marc Snir. http://wing.cs.uiuc.edu/group/patterns/.
26. Raja Vallée-Rai, Phong Co, Etienne Gagnon, Laurie Hendren, Patrick Lam, and Vijay Sundaresan. Soot - a java bytecode optimization framework. In CASCON '99, page 13, 1999.