Internally deterministic parallel algorithms can be fast

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

Volumn , Issue , 2012, Pages 181-192

  Blelloch, Guy E ^a   Fineman, Jeremy T ^b   Gibbons, Phillip B ^c   Shun, Julian ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b GEORGETOWN UNIVERSITY   (United States)

^c INTEL CORPORATION   (United States)

Author keywords

Commutative operations; Deterministic parallelism; Geometry algorithms; Graph algorithms; Parallel algorithms; Parallel programming; Sorting; String processing

Indexed keywords

BENCH-MARK PROBLEMS; COMMUTATIVE OPERATIONS; CONCURRENT OPERATIONS; CORE MACHINES; DEPENDENCE GRAPHS; DETERMINISTIC ALGORITHMS; DETERMINISTIC APPROACH; DETERMINISTIC PARALLELISM; GRAPH ALGORITHMS; NESTED PARALLELISM; PROGRAMMING PARADIGMS; STRING PROCESSING; STRONG FORM;

COMPUTER PROGRAMMING LANGUAGES; CONCURRENCY CONTROL; DATA STRUCTURES; FUNCTIONAL PROGRAMMING; PARALLEL ARCHITECTURES; PARALLEL PROGRAMMING; SEMANTICS; SORTING;

PARALLEL ALGORITHMS;

EID: 84858427811     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2145816.2145840     Document Type: Conference Paper

References (45)

1. U. Acar, G. E. Blelloch, and R. Blumofe. The data locality of work stealing. Theory of Computing Systems, 35(3), 2002. Springer.
2. S. V. Adve and M. D. Hill. Weak ordering-a new definition. In ACM ISCA, 1990.
3. T. Bergan, O. Anderson, J. Devietti, L. Ceze, and D. Grossman. Core- Det: A compiler and runtime system for deterministic multithreaded execution. In ACM ASPLOS, 2010.
4. T. Bergan, N. Hunt, L. Ceze, and S. D. Gribble. Deterministic process groups in dOS. In Usenix OSDI, 2010.
5. E. D. Berger, T. Yang, T. Liu, and G. Novark. Grace: Safe multithreaded programming for C/C++. In ACM OOPSLA, 2009.
6. G. E. Blelloch. Programming parallel algorithms. CACM, 39(3), 1996.
7. G. E. Blelloch and D. Golovin. Strongly history-independent hashing with applications. In IEEE FOCS, 2007.
8. G. E. Blelloch and J. Greiner. A provable time and space efficient implementation of NESL. In ACM ICFP, 1996.
9. G. E. Blelloch, P. B. Gibbons, and H. V. Simhadri. Low-depth cache oblivious algorithms. In ACM SPAA, 2010.
10. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. J. Parallel and Distributed Computing, 37(1), 1996. Elsevier.
11. R. L. Bocchino, V. S. Adve, S. V. Adve, and M. Snir. Parallel programming must be deterministic by default. In Usenix HotPar, 2009.
12. R. L. Bocchino, S. Heumann, N. Honarmand, S. V. Adve, V. S. Adve, A. Welc, and T. Shpeisman. Safe nondeterminism in a deterministicby- default parallel language. In ACM POPL, 2011.
13. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42(1), 1995.
14. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In SIAM SDM, 2004.
15. G.-I. Cheng, M. Feng, C. E. Leiserson, K. H. Randall, and A. F. Stark. Detecting data races in Cilk programs that use locks. In ACM SPAA, 1998.
16. B. Choi, R. Komuravelli, V. Lu, H. Sung, R. L. Bocchino, S. V. Adve, and J. C. Hart. Parallel SAH k-D tree construction. In ACM High Performance Graphics, 2010.
17. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001.
18. M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2008.
19. J. Devietti, B. Lucia, L. Ceze, and M. Oskin. DMP: Deterministic shared memory multiprocessing. In ACM ASPLOS, 2009.
20. J. Devietti, J. Nelson, T. Bergan, L. Ceze, and D. Grossman. RCDC: A relaxed consistency deterministic computer. In ACM ASPLOS, 2011.
21. E. W. Dijkstra. Cooperating sequential processes. Technical Report EWD 123, Dept. of Mathematics, Technological U., Eindhoven, 1965.
22. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In ACM ISCA, 1990.
23. P. B. Gibbons. A more practical PRAM model. In ACM SPAA, 1989.
24. R. H. Halstead. Multilisp: A language for concurrent symbolic computation. ACM TOPLAS, 7(4), 1985.
25. M. A. Hassaan, M. Burtscher, and K. Pingali. Ordered vs. unordered: A comparison of parallelism and work-efficiency in irregular algorithms. In ACM PPoPP, 2011.
26. M. Herlihy and E. Koskinen. Transactional boosting: A methodology for highly-concurrent transactional objects. In ACM PPoPP, 2008.
27. M. P. Herlihy and J. M.Wing. Linearizability: A correctness condition for concurrent objects. ACM TOPLAS, 12(3), 1990.
28. D. Hower, P. Dudnik, M. Hill, and D. Wood. Calvin: Deterministic or not? Free will to choose. In IEEE HPCA, 2011.
29. J. Karkkainen and P. Sanders. Simple linear work suffix array construction. In EATCS ICALP, 2003.
30. M. Kulkarni, D. Nguyen, D. Prountzos, X. Sui, and K. Pingali. Exploiting the commutativity lattice. In ACM PLDI, 2011.
31. C. E. Leiserson. The Cilk++ concurrency platform. J. Supercomputing, 51(3), 2010. Springer.
32. C. E. Leiserson and T. B. Schardl. A work-efficient parallel breadthfirst search algorithm (or how to cope with the nondeterminism of reducers). In ACM SPAA, 2010.
33. C. E. Leiserson, T. B. Schardl, and J. Sukha. Deterministic parallel random-number generation for dynamic-multithreading platforms. In ACM PPoPP, 2012.
34. J. D. MacDonald and K. S. Booth. Heuristics for ray tracing using space subdivision. The Visual Computer, 6(3), 1990. Springer.
35. R. H. B. Netzer and B. P. Miller. What are race conditions? ACM LOPLAS, 1(1), 1992.
36. M. Olszewski, J. Ansel, and S. Amarasinghe. Kendo: Efficient deterministic multithreading in software. In ACM ASPLOS, 2009.
37. S. S. Patil. Closure properties of interconnections of determinate systems. In J. B. Dennis, editor, Record of the Project MAC conference on concurrent systems and parallel computation. ACM, 1970.
38. K. Pingali, D. Nguyen, M. Kulkarni, M. Burtscher, M. A. Hassaan, R. Kaleem, T.-H. Lee, A. Lenharth, R. Manevich, M. Ḿendez-Lojo, D. Prountzos, and X. Sui. The tao of parallelism in algorithms. In ACM PLDI, 2011.
39. P. Prabhu, S. Ghosh, Y. Zhang, N. P. Johnson, and D. I. August. Commutative set: A language extension for implicit parallel programming. In ACM PLDI, 2011.
40. M. C. Rinard and P. C. Diniz. Commutativity analysis: A new analysis technique for parallelizing compilers. ACM TOPLAS, 19(6), 1997.
41. J. Singler, P. Sanders, and F. Putze. MCSTL: The multi-core standard template library. In Euro-Par, 2007.
42. G. L. Steele Jr. Making asynchronous parallelism safe for the world. In ACM POPL, 1990.
43. J. G. Steffan, C. B. Colohan, A. Zhai, and T. C. Mowry. A scalable approach to thread-level speculation. In ACM ISCA, 2000.
44. W. E. Weihl. Commutativity-based concurrency control for abstract data types. IEEE Trans. Computers, 37(12), 1988.
45. J. Yu and S. Narayanasamy. A case for an interleaving constrained shared-memory multi-processor. In ACM ISCA, 2009.