Freeze after writing: Quasi-deterministic parallel programming with LVars

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2014, Pages 257-270

  Kuper, Lindsey ^a   Turon, Aaron ^b   Krishnaswami, Neelakantan R ^c   Newton, Ryan R ^a  

^a INDIANA UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^c UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

deterministic parallelism; lattices; quasi determinism

Indexed keywords

DETERMINISTIC PARALLELISMS; EVENT-HANDLERS; PARALLEL PROGRAMMING MODEL; PARALLEL SPEEDUPS; PROGRAMMING MODELS; QUASIDETERMINISM; SHARED MEMORY; SHARED STATE;

COMPUTER PROGRAMMING LANGUAGES; CRYSTAL LATTICES; SEMANTICS;

PARALLEL PROGRAMMING;

EID: 84893510148     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2535838.2535842     Document Type: Conference Paper

References (33)

1. Arvind, R. S. Nikhil, and K. K. Pingali. I-structures: data structures for parallel computing. ACM Trans. Program. Lang. Syst., 11, October 1989.
2. H. Attiya, R. Guerraoui, D. Hendler, P. Kuznetsov, M. M. Michael, and M. Vechev. Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. In POPL, 2011.
3. D. A. Bader and K. Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In ICPP, 2006.
4. R. L. Bocchino, Jr., V. S. Adve, S. V. Adve, and M. Snir. Parallel programming must be deterministic by default. In HotPar, 2009.
5. 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 OOPSLA, 2009.
6. R. L. Bocchino, Jr. et al. Safe nondeterminism in a deterministic-by- default parallel language. In POPL, 2011.
7. Z. Budimlić, M. Burke, V. Cavé, K. Knobe, G. Lowney, R. Newton, J. Palsberg, D. Peixotto, V. Sarkar, F. Schlimbach, and S. Taşirlar. Concurrent Collections. Sci. Program., 18, August 2010.
8. S. Burckhardt and D. Leijen. Semantics of concurrent revisions. In ESOP, 2011.
9. B. L. Chamberlain, D. Callahan, and H. P. Zima. Parallel programmability and the Chapel language. International Journal of High Performance Computing Applications, 21(3), 2007.
10. D. Chase and Y. Lev. Dynamic circular work-stealing deque. In SPAA, 2005.
11. N. Conway, W. Marczak, P. Alvaro, J. M. Hellerstein, and D. Maier. Logic and lattices for distributed programming. In SOCC, 2012.
12. C. Earl, I. Sergey, M. Might, and D. Van Horn. Introspective pushdown analysis of higher-order programs. In ICFP, 2012.
13. F. Ellen, Y. Lev, V. Luchangco, and M. Moir. SNZI: Scalable NonZero Indicators. In PODC, 2007.
14. M. Felleisen, R. B. Findler, and M. Flatt. Semantics Engineering with PLT Redex. The MIT Press, 1st edition, 2009.
15. K. Fraser. Practical lock-freedom. PhD thesis, 2004.
16. M. I. Gordon, W. Thies, M. Karczmarek, J. Lin, A. S. Meli, C. Leger, A. A. Lamb, J. Wong, H. Hoffman, D. Z. Maze, and S. Amarasinghe. A stream compiler for communication-exposed architectures. In ASPLOS, 2002.
17. M. Herlihy and N. Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann, 2008.
18. G. Kahn. The semantics of a simple language for parallel programming. In J. L. Rosenfeld, editor, Information processing. North Holland, Amsterdam, Aug 1974.
19. L. Kuper and R. R. Newton. LVars: lattice-based data structures for deterministic parallelism. In FHPC, 2013.
20. L. Kuper, A. Turon, N. R. Krishnaswami, and R. R. Newton. Freeze after writing: Quasi-deterministic parallel programming with LVars. Technical Report TR710, Indiana University, November 2013. URL http://www.cs.indiana.edu/cgi-bin/ techreports/TRNNN.cgi?trnum=TR710.
21. E. Lee and D. Messerschmitt. Synchronous data flow. Proceedings of the IEEE, 75(9):1235-1245, 1987.
22. D. Leijen, M. Fahndrich, and S. Burckhardt. Prettier concurrency: purely functional concurrent revisions. In Haskell, 2011.
23. S. Marlow, P. Maier, H.-W. Loidl, M. K. Aswad, and P. Trinder. Seq no more: better strategies for parallel Haskell. In Haskell, 2010.
24. S. Marlow, R. Newton, and S. Peyton Jones. Amonad for deterministic parallelism. In Haskell, 2011.
25. M. M. Michael, M. T. Vechev, and V. A. Saraswat. Idempotent work stealing. In PPoPP, 2009.
26. M. Might. k -CFA: Determining types and/or controlflow in languages like Python, Java and Scheme. http://matt.might.net/articles/implementation-of-kcfa- and-0cfa/.
27. R. S. Nikhil. Id language reference manual, 1991.
28. S. L. Peyton Jones, R. Leshchinskiy, G. Keller, and M. M. T. Chakravarty. Harnessing the multicores: Nested data parallelism in Haskell. In FSTTCS, 2008.
29. A. Prokopec, H. Miller, T. Schlatter, P. Haller, and M. Odersky. Flow-Pools: a lock-free deterministic concurrent dataflow abstraction. In LCPC, 2012.
30. J. H. Reppy. Concurrent Programming in ML. Cambridge University Press, Cambridge, England, 1999.
31. M. Shapiro, N. Preguiça, C. Baquero, and M. Zawirski. Conflict-free replicated data types. In SSS, 2011.
32. L. G. Tesler and H. J. Enea. A language design for concurrent processes. In AFIPS, 1968 (Spring).
33. K. B. Wheeler, R. C. Murphy, and D. Thain. Qthreads: An API for programming with millions of lightweight threads, 2008.