Prettier concurrency: Purely functional concurrent revisions

Haskell'11 - Proceedings of the 2011 ACM SIGPLAN Haskell Symposium

Volumn , Issue , 2011, Pages 83-94

  Leijen, Daan ^a   Fähndrich, Manuel ^a   Burckhardt, Sebastian ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

concurrent revisions; isolation; transaction

Indexed keywords

CONCURRENT GAMES; CONCURRENT REVISIONS; CONCURRENT TASKS; CONFLICT RESOLUTION; I/O OPERATIONS; ISOLATION; SHARED DATA STRUCTURE; SOFTWARE TRANSACTIONAL MEMORY; TRANSACTION; TRANSACTION MODEL;

COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES;

CONCURRENCY CONTROL;

EID: 82655172838     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2034675.2034686     Document Type: Conference Paper

References (28)

1. M. Abadi, A. Birrell, T. Harris, and M. Isard. Semantics of transactional memory and automatic mutual exclusion. In Principles of Prog. Lang. (POPL), pages 63-74, 2008.
2. H. Berenson, P. Bernstein, J. Gray, J. Melton, E. O'Neil, and P. O'Neil. A critique of ANSI SQL isolation levels. In Proceedings of SIGMOD, pages 1-10, 1995.
3. Sebastian Burckhardt, Alexandro Baldassion, and Daan Leijen. Concurrent programming with revisions and isolation types. In OOPSLA'10, October 2010.
4. Sebastian Burckhardt, Manuel Fähndrich, and Daan Leijen. Roll Forward, not Back - A Case for Deterministic Conflict Resolution. In The 2nd Workshop on Determinism and Correctness in Parallel Programming, 2011.
5. Sebastian Burckhardt and Daan Leijen. Semantics of concurrent revisions. In European Symposium on Programming (ESOP'11), 2011.
6. Manuel M. T. Chakravarty, Gabriele Keller, Roman Lechtchinsky, and Wolf Pfannenstiel. Nepal - Nested Data-Parallelism in Haskell. In Euro-Par 2001: Parallel Processing, LNCS 2150, pages 524-534, 2001.
7. A. Fekete, D. Liarokapis, E. O'Neil, P. O'Neil, and D. Shasha. Making snapshot isolation serializable. ACM Trans. Database Syst., 30(2):492-528, 2005. (Pubitemid 41204997)
8. M. Frigo, P. Halpern, C. E. Leiserson, and S. Lewin-Berlin. Reducers and other cilk++ hyperobjects. In Sym. on Par. Algorithms and Architectures (SPAA), pages 79-90, 2009.
9. Tim Harris, Simon Marlow, Simon Peyton-Jones, and Maurice Herlihy. Composable memory transactions. In Principles and Practice of Parallel Programming, PPoPP '05, pages 48-60, 2005.
10. M. Herlihy and E. Koskinen. Transactional boosting: a methodology for highly-concurrent transactional objects. In Principles and Practice of Parallel Programming (PPoPP), pages 207-216, 2008.
11. M. Herlihy and J. Wing. Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463-492, 1990. (Pubitemid 20721345)
12. E. Koskinen, M. Parkinson, and M. Herlihy. Coarse-grained transactions. In Principles of Programming Languages (POPL), pages 19-30, 2010.
13. M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and L. Chew. Optimistic parallelism requires abstractions. In (PLDI), 2007.
14. Daan Leijen. Haskell revisions. Implementation available at www.research.microsoft.com/people/daan, 2011.
15. Daan Leijen and Erik Meijer. Domain specific embedded compilers. In 2nd USENIX Conference on Domain SpecificLanguages (DSL'99), pages 109-122, Austin, Texas, October 1999.
16. Also in ACM SIGPLAN Notices 35, 1, (Jan. 2000).
17. Simon Marlow, Patrick Maier, Hans-Wolfgang Loidl, Mustafa K. Aswad, and Phil Trinder. Seq no more: Better strategies for parallel haskell. In 3rd Haskell Symposium, pages 91-102, September 2010.
18. Simon Marlow, Simon L. Peyton-Jones, and Satnam Singh. Runtime support for multicore Haskell. In ICFP 2009 - Intl. Conf. on Functional Programming, pages 65-78, Edinburgh, Scotland, August 2009.
19. P.A.Bernstein and N.Goodman. Multiversion concurrency control|theory and algorithms. ACM Trans. Database Syst., 8(4):465-483, 1983.
20. P.A.Bernstein, V.Hadzilacos, and N.Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
21. Simon Peyton Jones. Beautiful concurrency, 2007. Appears as a chapter in "Beautiful Code: Leading programmers explain how they think" (O'Reilly).
22. Simon Peyton Jones, Andrew Gordon, and Sigbjorn Finne. Concurrent Haskell. In 23rd ACM Symposium on Principles of Programming Languages, pages 295-308, January 1996.
23. Simon Peyton Jones, Roman Leshchinskiy, Gabrielle Keller, and Manuel M. T. Chakravarty. Harnessing the Multicores: Nested Data Parallelism in Haskell. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2008), 2008.
24. Simon L Peyton Jones and John Launchbury. State in Haskell. Lisp and Symbolic Comp., 8(4):293-341, 1995.
25. K. Randall. Cilk: Efficient Multithreaded Computing. PhD thesis, Dept. of Electrical Engineering and Computer Science, MIT, May 1998.
26. T. Riegel, C. Fetzer, and P. Felber. Snapshot isolation for software transactional memory. In Workshop on Transactional Computing (TRANSACT), 2006.
27. Philip W. Trinder, Kevin Hammond, Hans-Wolfgang Loidl, and Simon L. Peyton Jones. Algorithm + Strategy = Parallelism. Journal of Functional Programming, 8(1):23-60, January 1998.
28. Philip W. Trinder, Kevin Hammond, James S. Mattson Jr., Andrew S. Partridge, and Simon L. Peyton Jones. GUM: a portable implementation of Haskell. In Programming Language Design and Implementation, May 1996.