A deterministic multi-way rendezvous library for haskell
Vasudevan, N.
Singh, S.
Edwards, S.A.
Dept. of Comput. Sci., Columbia Univ. New York, Columbia, NY;
This paper appears in: Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on
Publication Date: 14-18 April 2008
On page(s): 1-12
Location: Miami, FL,
ISSN: 1530-2075
ISBN: 978-1-4244-1693-6
INSPEC Accession Number: 10025196
Digital Object Identifier: 10.1109/IPDPS.2008.4536312
Current Version Published: 2008-06-03
Abstract
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
