Blogs (28) >>
ICFP 2017
Sun 3 - Sat 9 September 2017 Oxford, United Kingdom
Fri 8 Sep 2017 16:50 - 17:20 at L1 - Day 2, Session 6

Software transactional memory (STM) has made it significantly easier to write correct concurrent programs in Haskell. Its performance, however, is limited by several inefficiencies. While safe concurrent computations are easy to express in Haskell’s STM, concurrent data structures suffer unfortunate bloat in the implementation due to an extra level of indirection for mutable references as well as the inability to express unboxed mutable transactional values. We address these deficiencies by introducing TStruct to the GHC run-time system, allowing strict unboxed transactional values as well as mutable references without an extra indirection. Using TStruct we implement several data structures, discuss their design, and provide benchmark results on a large multicore machine. Our benchmarks show that concurrent data structures built with TStruct out-scale and out-perform their TVar-based equivalents.

Fri 8 Sep

16:50 - 17:50: Haskell 2017 - Day 2, Session 6 at L1
haskellsymp-2017-papers150488220000016:50 - 17:20
Ryan Yates, Michael ScottUniversity of Rochester
haskellsymp-2017-papers150488400000017:20 - 17:50
Chao-Hong ChenIndiana University, Vikraman Choudhury, Ryan R. NewtonIndiana University