ekmett/speculation
1
1
Fork 0
mirror of https://github.com/ekmett/speculation.git synced 2024-07-04 16:46:22 +03:00
Code Issues Projects Releases Wiki Activity
Safe, programmable, speculative evaluation for Haskell
88 Commits 2 Branches 4 Tags 232 KiB
Haskell 100%
master
Go to file
Edward Kmett 354a3accdb bump and CHANGELOG [ci skip]
2016-01-17 00:43:03 -05:00
src/Control/Concurrent remove redundant Monad m => constraint from instance MonadSpec (ContT r m) 2015-03-08 10:45:10 +00:00
.gitignore streamlined MonadSpec 2011-11-09 00:36:12 -05:00
.travis.yml multi-ghc travis config 2015-03-08 06:18:54 -04:00
Benchmark.hs test suite now forces build if necessary 2010-06-27 23:56:14 -07:00
CHANGELOG.markdown bump and CHANGELOG [ci skip] 2016-01-17 00:43:03 -05:00
HLint.hs add an HLint configuration 2015-03-08 06:30:09 -04:00
ISSUES.markdown 1.3 release candidate 2011-11-09 00:26:35 -05:00
LICENSE copyright bump, whitespace cleanup 2015-03-08 06:32:52 -04:00
README.markdown 1.3 release candidate 2011-11-09 00:26:35 -05:00
Setup.lhs lobotomized build process 2012-05-10 18:17:19 -04:00
speculation.cabal bump and CHANGELOG [ci skip] 2016-01-17 00:43:03 -05:00
Test.hs Allow Test.hs to work with the current codebase. 2014-01-07 11:40:19 -05:00

README.markdown

speculation

A framework for safe, programmable, speculative parallelism, loosely based on:

This package provides speculative function application and speculative folds. Speculative STM transactions take the place of the transactional rollback machinery from the paper.

You can download it using cabal install speculation, if you have the Haskell Platform installed.

Speculative Function Application (Control.Concurrent.Speculation)

Various speculative function application combinators are provided. Two fairly canonical samples are described here.

spec

spec :: Eq a => a -> (a -> b) -> a -> b

spec g f a evaluates f g while forcing a, if g == a then f g is returned. Otherwise f a is evaluated.

Furthermore, if the argument has already been evaluated, we avoid sparking the parallel computation at all.

If g is a good guess at the value of a, this is one way to induce parallelism in an otherwise sequential task.

However, if g isn't available more cheaply than a, then this saves no work, and if g is wrong, you risk evaluating the function twice. spec a f a = f $! a

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

specSTM provides a similar compressed timeline for speculated STM actions, but also rolls back side-effects.

Speculative Folds (Data.Foldable.Speculation)

A speculative version of the combinators from Data.Foldable is provided as Data.Foldable.Speculation.

Each combinator therein takes an extra argument that is used to speculate on the value of the list.

foldr

foldr :: (Foldable f, Eq b) => (Int -> b) -> (a -> b -> b) -> b -> f a -> b

Given a valid estimator g, foldr g f z xs yields the same answer as Foldable.foldr' f z xs.

g n should supply an estimate of the value returned from folding over the last n elements of the container.

As with spec, if the guess g n is accurate a reasonable percentage of the time and faster to compute than the ensuing fold, then this can provide increased opportunities for parallelism.

foldl

foldl :: (Foldable f, Eq b) => (Int -> b) -> (b -> a -> b) -> b -> f a -> b

foldl works similarly to Foldable.foldl', except that g n should provide an estimate for the first n elements.

Contact Information

Contributions and bug reports are welcome!

I can be reached through the user ekmett on github, as edwardk on irc.freenode.net #haskell channel, or by email at ekmett@gmail.com.

-Edward Kmett