Parallel closures: A new twist on an old idea

4th USENIX Workshop on Hot Topics in Parallelism, HotPar 2012

Volumn , Issue , 2012, Pages

  Matsakis, Nicholas D ^a  

^a Mozilla Research

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROGRAMMING;

ATOMIC ACTIONS; DATA RACES; DETERMINISTIC EXECUTION; LIGHTWEIGHT TASKS; PROGRAMMING ABSTRACTIONS; TYPE SYSTEMS;

STRUCTURED PROGRAMMING;

EID: 85028051944     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (43)

1. M. Abadi, C. Flanagan, and S. N. Freund. Types for safe locking: Static race detection for java. ACM Trans. Program. Lang. Syst., 28:207-255, March 2006.
2. R. Agarwal and S. D. Stoller. Run-time detection of potential deadlocks for programs with locks, semaphores, and condition variables. In Proceedings of the 2006 workshop on Parallel and distributed systems: testing and debugging, PADTAD '06, pages 51-60, New York, NY, USA, 2006. ACM.
3. Z. Anderson, D. Gay, R. Ennals, and E. Brewer. SharC: checking data sharing strategies for multithreaded C. In Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation, PLDI '08, pages 149- 158, New York, NY, USA, 2008. ACM.
4. R. L. Bocchino, Jr., V. S. Adve, D. Dig, S. V. Adve, S. Heumann, R. Komuravelli, J. Overbey, P. Simmons, H. Sung, and M. Vakilian. A type and effect system for deterministic parallel java. In Proceeding of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications, OOPSLA '09, pages 97- 116, New York, NY, USA, 2009. ACM.
5. R. L. Bocchino, Jr., S. Heumann, N. Honarmand, S. V. Adve, V. S. Adve, A.Welc, and T. Shpeisman. Safe nondeterminism in a deterministic-by-default parallel language. SIGPLAN Not., 46(1):535-548, Jan. 2011.
6. C. Boyapati, R. Lee, and M. Rinard. Ownership types for safe programming: preventing data races and deadlocks. In Proceedings of the 17th ACM SIGPLAN conference on Objectoriented programming, systems, languages, and applications, OOPSLA '02, pages 211-230, New York, NY, USA, 2002. ACM.
7. J. Boyland. Checking interference with fractional permissions. In Proceedings of the 10th international conference on Static analysis, SAS'03, pages 55-72, Berlin, Heidelberg, 2003. Springer-Verlag.
8. P. Charles, C. Grothoff, V. Saraswat, C. Donawa, A. Kielstra, K. Ebcioglu, C. von Praun, and V. Sarkar. X10: an objectoriented approach to non-uniform cluster computing. In Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, OOPSLA '05, pages 519-538, New York, NY, USA, 2005. ACM.
9. J.-D. Choi, K. Lee, A. Loginov, R. O'Callahan, V. Sarkar, and M. Sridharan. Efficient and precise datarace detection for multithreaded object-oriented programs. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, PLDI '02, pages 258-269, New York, NY, USA, 2002. ACM.
10. M. Christiaens and K. D. Bosschere. Trade: Data race detection for java. In Proceedings of the International Conference on Computational Science-Part II, ICCS '01, pages 761-770, London, UK, UK, 2001. Springer-Verlag.
11. J. Darlington, A. J. Field, P. G. Harrison, P. H. J. Kelly, D. W. N. Sharp, and Q. Wu. Parallel programming using skeleton functions. In Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe, PARLE '93, pages 146-160, London, UK, 1993. Springer-Verlag.
12. T. Elmas, S. Qadeer, and S. Tasiran. Goldilocks: a race and transaction-aware java runtime. In Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, PLDI '07, pages 245-255, New York, NY, USA, 2007. ACM.
13. M. Feng and C. E. Leiserson. Efficient detection of determinacy races in cilk programs. In Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, SPAA '97, pages 1-11, New York, NY, USA, 1997. ACM.
14. C. Flanagan and S. N. Freund. The roadrunner dynamic analysis framework for concurrent programs. In Proceedings of the 9th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, PASTE '10, pages 1-8, New York, NY, USA, 2010. ACM.
15. C. Flanagan, S. N. Freund, and J. Yi. Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs. In Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation, PLDI '08, pages 293-303, New York, NY, USA, 2008. ACM
16. A. Greenhouse and W. L. Scherlis. Assuring and evolving concurrent programs: annotations and policy. In Proceedings of the 24th International Conference on Software Engineering, ICSE '02, pages 453-463, New York, NY, USA, 2002. ACM.
17. D. Grossman. Type-safe multithreading in cyclone. In Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation, TLDI '03, pages 13-25, New York, NY, USA, 2003. ACM.
18. P. Haller and M. Odersky. Capabilities for uniqueness and borrowing. In Proceedings of the 24th European conference on Object-oriented programming, ECOOP'10, pages 354-378, Berlin, Heidelberg, 2010. Springer-Verlag.
19. R. H. Halstead, Jr. Implementation of multilisp: Lisp on a multiprocessor. In Proceedings of the 1984 ACM Symposium on LISP and functional programming, LFP '84, pages 9-17, New York, NY, USA, 1984. ACM.
20. K. J. Hoffman, H. Metzger, and P. Eugster. Ribbons: a partially shared memory programming model. In Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications, OOPSLA '11, pages 289-306, New York, NY, USA, 2011. ACM.
21. A. Kulkarni, Y. D. Liu, and S. F. Smith. Task types for pervasive atomicity. In Proceedings of the ACM international conference on Object oriented programming systems languages and applications, OOPSLA '10, pages 671-690, New York, NY, USA, 2010. ACM.
22. K. R. Leino and P. Müller. A basis for verifying multithreaded programs. In Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, ESOP '09, pages 378-393, Berlin, Heidelberg, 2009. Springer-Verlag.
23. J. M. Lucassen and D. K. Gifford. Polymorphic effect systems. In Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL '88, pages 47-57, New York, NY, USA, 1988. ACM.
24. N. D. Matsakis. https://github.com/mozilla/pjs.
25. N. D. Matsakis. https://github.com/nikomatsakis/patpar.
26. N. D. Matsakis. Intervals: Data-Race-Free Parallel Programming. PhD thesis, ETH Zurich, 2011.
27. J. Mccarthy and P. J. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence, pages 463-502. Edinburgh University Press, 1969.
28. M. D. McCool. Structured parallel programming with deterministic patterns. In Proceedings of the 2nd USENIX conference on Hot topics in parallelism, HotPar'10, pages 5-5, Berkeley, CA, USA, 2010. USENIX Association.
29. N. H. Minsky. Towards alias-free pointers. In Proceedings of the 10th European Conference on Object-Oriented Programming, pages 189-209, London, UK, 1996. Springer-Verlag.
30. A. Navabi and S. Jagannathan. Exceptionally safe futures. In Proceedings of the 11th International Conference on Coordination Models and Languages, COORDINATION '09, pages 47-65, Berlin, Heidelberg, 2009. Springer-Verlag.
31. A. Navabi, X. Zhang, and S. Jagannathan. Quasi-static scheduling for safe futures. In PPoPP. ACM, 2008.
32. OpenMP Architecture Review Board. OpenMP 3.0 Specification, May 2008.
33. E. Pozniansky and A. Schuster. Multirace: efficient on-the-fly data race detection in multithreaded c++ programs: Research articles. Concurr. Comput.: Pract. Exper., 19(3):327-340, Mar. 2007.
34. R. Raman, J. Zhao, V. Sarkar, M. Vechev, and E. Yahav. Efficient data race detection for async-finish parallelism. In Proceedings of the First international conference on Runtime verification, RV'10, pages 368-383, Berlin, Heidelberg, 2010. Springer-Verlag.
35. C. Sadowski, S. Freund, and C. Flanagan. Singletrack: A dynamic determinism checker for multithreaded programs. In G. Castagna, editor, Programming Languages and Systems, volume 5502 of Lecture Notes in Computer Science, pages 394-409. Springer Berlin / Heidelberg, 2009.
36. S. Savage, M. Burrows, G. Nelson, P. Sobalvarro, and T. Anderson. Eraser: a dynamic data race detector for multithreaded programs. ACM Trans. Comput. Syst., 15:391-411, November 1997.
37. Supercomputing Technologies Group, Massachusetts Institute of Technology Laboratory for Computer Science. Cilk 5.4.6 Reference Manual, Nov. 2001.
38. T. Terauchi. Checking race freedom via linear programming. In Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation, PLDI '08, pages 1-10, New York, NY, USA, 2008. ACM.
39. M. S. Tschantz and M. D. Ernst. Javari: Adding reference immutability to Java. In Object-Oriented Programming Systems, Languages, and Applications (OOPSLA 2005), pages 211-230, San Diego, CA, USA, October 18-20, 2005.
40. A. Welc, S. Jagannathan, and A. Hosking. Safe futures for java. In Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, OOPSLA '05, pages 439-453, New York, NY, USA, 2005. ACM.
41. E.Westbrook, J. Zhao, Z. Budimlic, and V. Sarkar. Perimssion regions for race-free parallelism. In Proceedings of the 2nd International Conference on Runtime Verification (RV '11), September 2011.
42. J. Yi, C. Sadowski, and C. Flanagan. Cooperative reasoning for preemptive execution. In Proceedings of the 16th ACM symposium on Principles and practice of parallel programming, PPoPP '11, pages 147-156, New York, NY, USA, 2011. ACM.
43. Y. Yu, T. Rodeheffer, and W. Chen. Racetrack: efficient detection of data race conditions via adaptive tracking. In Proceedings of the twentieth ACM symposium on Operating systems principles, SOSP '05, pages 221-234, New York, NY, USA, 2005. ACM.