Scheduling strategies for optimistic parallel execution of irregular programs

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2008, Pages 217-228

  Kulkarni, Milind ^a   Carribault, Patrick ^a   Pingali, Keshav ^a   Ramanarayanan, Ganesh ^b   Walter, Bruce ^b   Bala, Kavita ^b   Chew, L Paul ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

Irregular programs; Optimistic parallelism; Scheduling

Indexed keywords

APPLICATION SPECIFICS; APPLICATION STUDIES; DATA PARALLELISMS; GENERAL APPROACHES; IRREGULAR APPLICATIONS; IRREGULAR PROBLEMS; IRREGULAR PROGRAMS; ITERATIVE COMPUTATIONS; ITERATORS; LOOP SCHEDULING; OPTIMAL SCHEDULING; OPTIMISTIC PARALLELISM; PARALLEL APPLICATIONS; PARALLEL EXECUTIONS; PARALLELIZATION; PARALLELIZING; RUN-TIME SYSTEMS; SCHEDULING FRAMEWORKS; SCHEDULING STRATEGIES; SYSTEM USING;

INFORMATION MANAGEMENT; KNOWLEDGE MANAGEMENT; PARALLEL PROCESSING SYSTEMS; SCHEDULING; STRUCTURED PROGRAMMING;

APPLICATIONS;

EID: 57349108625     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1378533.1378575     Document Type: Conference Paper

References (23)

1. Yuri Boykov and Vladimir Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. International Journal of Computer Vision (IJCV), 70(2): 109-131, 2006.
2. Shimin Chen, Phillip B. Gibbons, Michael Kozuch, Vasileios Liaskovitis, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi, Limor Fix, Nikos Hardavellas, Todd C. Mowry, and Chris Wilkerson. Scheduling threads for constructive cache sharing on cmps. In SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, pages 105-115, New York, NY, USA, 2007. ACM Press.
3. L. Paul Chew. Guaranteed-quality mesh generation for curved surfaces. In SCG '93; Proceedings of the ninth annual symposium on Computational geometry, 1993.
4. Andrew V. Goldberg and Robert E. Tarjan. A new approach to the maximum-flow problem. J. ACM, 35(4):921-940, 1988.
5. Leonidas J. Guibas, Donald E. Knuth, and Micha Sharir. Randomized incremental construction of delaunay and voronoi diagrams. Algorithmica, 7(1 ):381-413, December 1992.
6. L. Hendren and A. Nicolau. Parallelizing programs with recursive data structures. IEEE Transactions on Parallel and Distributed Systems, 1(1):35-47, January 1990.
7. B. W. Kernighan and S. Lin. An effective heuristic procedure for partitioning graphs. The Bell System Technical Journal, pages 291-308, February 1970.
8. Charles H. Koelbel, David B. Loveman, Robert S. Schreiber, Jr. Guy L. Steele, and Mary E. Zosel. The high performance Fortran handbook. MIT Press, Cambridge, MA, USA, 1994.
9. Venkata Krishnan and Josep Torrellas. A chip-multiprocessor architecture with speculative multithreading. IEEE Trans. Comput., 48(9):866-880, 1999.
10. Milind Kulkarni, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, and L. Paul Chew. Optimistic parallelism benefits from data partitioning. SIGARCH Comput. Archit. News, 36(1 ):233-243, 2008.
11. Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, and L. Paul Chew. Optimistic parallelism requires abstractions. SIGPLAN Not. (Proceedings ofPLDI 2007), 42(6):211-222, 2007.
12. Jim Lams and Ravi Raj war. Transactional Memory (Synthesis Lectures on Computer Architecture). Morgan & Claypool Publishers, 2007.
13. Open MP.http://www.openmp.org
14. Guilherme Ottoni, Ram Rangan, Adam Stoler, and David I. August. Automatic thread extraction with decoupled software pipelining. In MICRO 38: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture, pages 105-118, Washington, DC, USA, 2005. IEEE Computer Society.
15. James Philbin, Jan Edler, Otto J. Anshus, Craig C. Douglas, and Kai Li. Thread scheduling for cache locality. In Architectural Support for Programming Languages and Operating Systems, pages 60-71, 1996.
16. Lawrence Rauchwerger and David A. Padua. The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. IEEE Trans. Parallel Distrib. Syst, 10(2): 160-180, 1999.
17. A. Rogers and K. Pingali. Process decomposition through locality of reference. In PLD1 '89: Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, pages 69-80, New York, NY, USA, 1989. ACM.
18. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems, 20(1): 1-50, January 1998.
19. William N. Scherer, III and Michael L. Scott. Advanced contention management for dynamic software transactional memory. In PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, pages 240-248, New York, NY, USA, 2005. ACM.
20. Jonathan Richard Shewchuk. Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In Applied Computational Geometry: Towards Geometric Engineering, volume 1148 of Lecture Notes in Computer Science, pages 203-222. Springer-Verlag, 1996.
21. Pang-Ning Tan, Michael Steinbach, and Vipin Kumar, editors. Introduction to Data Mining. Pearson Addison Wesley, 2005.
22. Neil Vachharajani, Ram Rangan, Easwaran Raman, Matthew J. Bridges, Guilherme Ottoni, and David I. August. Speculative decoupled software pipelining. In PACT '07: Proceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007), pages 49-59, Washington, DC, USA, 2007. IEEE Computer Society.
23. Bruce Walter, Sebastian Fernandez, Adam Arbree, Kavita Bala, Michael Donikian, and Donald Greenberg. Lightcuts: a scalable approach to illumination. ACM Transactions on Graphics (SIGGRAPH), 24(3):1098-1107, July 2005.