Implementing deterministic declarative concurrency using sieves

Authors:
Sam Lindley
Affiliations:
University of Edinburgh
Venue:
Proceedings of the 2007 workshop on Declarative aspects of multicore programming
Year:
2007

Citing 2
Cited 2

BSPlib: The BSP programming library

Parallel Computing
Composable memory transactions

Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming

Auto-parallelisation of sieve C++ programs

Euro-Par'07 Proceedings of the 2007 conference on Parallel processing
Delayed side-effects ease multi-core programming

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The predominant thread-based approach to concurrent programming is bug-prone, difficult to reason about, and does not scale well to large numbers of processors. Sieves provide a simple way of adding deterministic declarative concurrency to imperative programming languages. Sieve programs have a straightforward semantics, are not significantly more difficult to reason about than sequential imperative programs, and should scale to large numbers of processors as well as different processor architectures.