论文信息 - Concurrent Hash Tables for Haskell

Concurrent Hash Tables for Haskell

This paper presents seven hash table Haskell implementations, ranging from low-level synchronization mechanisms to high-level ones such as transactional memories. The result of the comparison between the algorithms showed that the implementation using the STM Haskell transactional memory library and fine-grain synchronization presented the best performance and good scalability.

[1] Simon L. Peyton Jones,et al. Runtime support for multicore Haskell , 2009, ICFP.

[2] Nir Shavit,et al. Split-ordered lists: Lock-free extensible hash tables , 2006, JACM.

[3] Simon Marlow. Parallel and Concurrent Programming in Haskell: Techniques for Multicore and Multithreaded Programming , 2013 .

[4] Ryan Newton,et al. Intel Concurrent Collections for Haskell , 2011 .

[5] Simon Marlow,et al. Comparing the performance of concurrent linked-list implementations in Haskell , 2009, DAMP '09.

[6] Simon Peyton Jones,et al. Tackling the Awkward Squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell , 2005 .

[7] Simon L. Peyton Jones,et al. Concurrent Haskell , 1996, POPL '96.

[8] James R. Larus,et al. Transactional Memory, 2nd edition , 2010, Transactional Memory.

[9] Mateo Valero,et al. unreadTVar: Extending Haskell Software Transactional Memory for Performance , 2007, Trends in Functional Programming.

[10] Maurice Herlihy,et al. The art of multiprocessor programming , 2020, PODC '06.

[11] Simon L. Peyton Jones,et al. Composable memory transactions , 2008, Commun. ACM.

[12] Simon L. Peyton Jones,et al. Parallel generational-copying garbage collection with a block-structured heap , 2008, ISMM '08.