A deterministic multi-way rendezvous library for haskell

The advent of multicore processors requires mainstream concurrent programming languages with high level concurrency constructs and effective debugging techniques. Unfortunately, many concurrent programming languages are non-deterministic and allow data races. We present a deterministic concurrent communication library for an existing multi-threaded language. We implemented the SHIM communication model in the Haskell functional language, which supports asynchronous communication and transactional memory. The SHIM model uses multi-way rendezvous to guarantee determinism. We describe two implementations of the model in Haskell, demonstrating the ease of writing such a library. We illustrate our library with examples and experimentally compare two implementations. We also compare our new model with equivalent sequential programs and parallel versions using Haskell’s existing concurrency mechanisms.

• Type: Conference
• Year: 2008
• Where: IPPS
• Authors: Nalini Vasudevan, Satnam Singh, Stephen A. Edwards
• Keywords: Concurrent Communication Library, Concurrent Programming Languages, Distributed And Parallel Computing, IPPS 2008, SHIM Communication Model