speculation
Version 0.8.0 revision 0 uploaded by EdwardKmett.
Package meta
- Synopsis
- A framework for safe, programmable, speculative parallelism
- Description
A framework for safe, programmable, speculative parallelism, loosely based on:
Prakash Prabhu, G. Ramalingam, and Kapil Vaswani, "Safe Programmable Speculative Parallelism", In the proceedings of Programming Language Design and Implementation (PLDI) Vol 45, Issue 6 (June 2010) pp 50-61. http://research.microsoft.com/pubs/118795/pldi026-vaswani.pdf
This package provides speculative function application and speculative folds. Speculative STM transactions take the place of the transactional rollback machinery from the paper.
For example:
spec g f a
evaluatesf g
while forcinga
, ifg == a
thenf g
is returned, otherwisef a
is evaluated and returned. Furthermore, if the argument has already been evaluated, we skip thef g
computation entirely. If a good guess at the value ofa
is available, this is one way to induce parallelism in an otherwise sequential task. However, if the guess isn't available more cheaply than the actual answer, then this saves no work and if the guess is wrong, you risk evaluating the function twice.The best-case timeline looks like:
[---- f g ----] [----- a -----] [-- spec g f a --]
The worst-case timeline looks like:
[---- f g ----] [----- a -----] [---- f a ----] [------- spec g f a -----------]
Compare these to the timeline of
f $! a
:[---- a -----] [---- f a ----]
specSTM provides a similar time table for STM actions, but also rolls back side-effects.
Changes in 0.8.0:
Test suite, code coverage, and benchmark suite added
- Author
- Edward A. Kmett
- Bug reports
- n/a
- Category
- Concurrency
- Copyright
- (c) 2010 Edward A. Kmett
- Homepage
- http://github.com/ekmett/speculation
- Maintainer
- Edward A. Kmett <ekmett@gmail.com>
- Package URL
- n/a
- Stability
- experimental