2010-06-27 10:58:44 +04:00
name: speculation
2011-01-19 21:50:47 +03:00
version: 1.2.0.2
2010-06-27 10:58:44 +04:00
license: BSD3
license-file: LICENSE
author: Edward A. Kmett
maintainer: Edward A. Kmett <ekmett@gmail.com>
stability: experimental
2010-06-27 11:44:55 +04:00
homepage: http://github.com/ekmett/speculation
2010-06-27 10:58:44 +04:00
category: Concurrency
2010-06-28 09:25:18 +04:00
copyright: (c) 2010 Edward A. Kmett
build-type: Custom
cabal-version: >=1.6
tested-with: GHC==6.12.1
2010-06-27 11:14:35 +04:00
synopsis: A framework for safe, programmable, speculative parallelism
2010-06-27 12:26:28 +04:00
description:
2010-06-28 02:30:18 +04:00
A framework for safe, programmable, speculative parallelism, loosely based on:
2010-06-27 19:02:55 +04:00
.
2010-06-28 02:30:18 +04:00
* 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
2010-06-27 19:02:55 +04:00
of the transactional rollback machinery from the paper.
.
For example:
.
2010-07-02 02:12:39 +04:00
@'spec' g f a@ evaluates @f g@ while forcing @a@, if @g == a@ then @f g@ is returned, otherwise @f a@ is evaluated and returned. Furthermore, if the argument has already been evaluated, we skip the @f g@ computation entirely. If a good guess at the value of @a@ 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. Under high load, since 'f g' is computed via the spark queue, the speculation will be skipped and you will obtain the same answer as 'f $! a'.
2010-06-27 19:02:55 +04:00
.
The best-case timeline looks like:
.
2010-07-02 02:12:39 +04:00
> foreground: [----- a -----]
> foreground: [-] (check g == a)
> spark: [----- f g -----]
> overall: [--- spec g f a ---]
2010-06-27 19:02:55 +04:00
.
The worst-case timeline looks like:
.
2010-07-02 02:12:39 +04:00
> foreground: [----- a -----]
> foreground: [-] (check g == a)
> foreground: [---- f a ----]
> spark: [----- f g -----]
> overall: [-------- spec g f a ---------]
.
Note that, if @f g@ takes longer than a to compute, in the HEAD release of GHC, @f g@ will be collected and killed during garbage collection.
.
> foreground: [----- a -----]
> foreground: [-] (check g == a)
> foreground: [---- f a ----]
> spark: [---- f g ----###### (#'s mark when this spark is collectable)
> overall: [--------- spec g f a --------]
.
Under high load:
.
> foreground: [----- a -----]
> foreground: [-] (check g == a)
> foreground: [---- f a ----]
> overall: [-------- spec g f a ---------]
2010-06-27 19:02:55 +04:00
.
Compare these to the timeline of @f $! a@:
.
2010-07-02 02:12:39 +04:00
> foreground: [----- a -----]
> foreground: [---- f a ----]
> orverall: [---------- f $! a ---------]
2010-06-27 19:02:55 +04:00
.
2011-01-19 21:21:57 +03:00
'specSTM' provides a similar time table for STM actions, but also rolls back side-effects. The one unfortunate operational distinction is that it is forced to compute 'a' in the background thread and therefore degrades slightly less gracefully under load, although we mitigate this effect by only enqueuing if the number of sparks for the current capability is lower than the total number of capabilities, to try to avoid wasting time when all computational resources are in use.
2010-06-28 09:25:18 +04:00
extra-source-files:
README.markdown
2010-06-28 11:17:32 +04:00
CHANGELOG.markdown
2010-06-29 01:04:53 +04:00
ISSUES.markdown
2010-06-28 09:25:18 +04:00
source-repository head
type: git
location: http://github.com/ekmett/speculation.git
branch: master
2011-01-19 21:21:57 +03:00
flag HasNumSparks
description: RTS provides GHC.Conc.numSparks
default: True
manual: False
2010-06-27 12:20:12 +04:00
2010-06-28 09:25:18 +04:00
flag tests
description: Build the tests
2010-06-28 18:34:49 +04:00
default: False
2010-06-28 09:25:18 +04:00
flag benchmarks
description: Build the benchmarks
2010-06-28 18:34:49 +04:00
default: False
flag optimize
description: Enable optimizations for the library and benchmarks
2010-06-28 09:50:45 +04:00
default: True
2010-06-28 09:25:18 +04:00
flag hpc
description: Use HPC for tests
default: True
2010-06-27 10:58:44 +04:00
library
2011-01-19 21:21:57 +03:00
ghc-options: -Wall
if flag(optimize)
ghc-options: -funbox-strict-fields -O2 -fspec-constr -fdicts-cheap
if flag(HasNumSparks)
cpp-options: -DHAS_NUM_SPARKS
build-depends: base >= 4.3 && < 6
else
build-depends: base >= 4 && < 4.3
2010-06-28 09:25:18 +04:00
2011-01-19 21:21:57 +03:00
build-depends:
2011-01-19 21:36:22 +03:00
ghc-prim >= 0.2 && < 0.4,
2011-01-19 21:21:57 +03:00
tag-bits >= 0.1 && < 0.2,
transformers >= 0.2.2.0 && < 0.3,
2011-01-19 21:36:22 +03:00
stm >= 2.1 && < 2.3
2010-06-27 10:58:44 +04:00
2011-01-19 21:21:57 +03:00
exposed-modules:
Data.Speculation
Data.Speculation.Cont
Data.Speculation.Morphism
Data.Speculation.Foldable
Data.Speculation.Traversable
Data.Speculation.List
other-modules:
Data.Speculation.Internal
2010-06-28 09:25:18 +04:00
executable test-speculation
main-is: Test.hs
if !flag(tests)
buildable: False
else
if flag(hpc)
ghc-options: -fhpc
2010-06-28 18:34:49 +04:00
x-hpc: true
2010-06-28 09:25:18 +04:00
ghc-options: -Wall
2011-01-19 21:21:57 +03:00
if flag(HasNumSparks)
cpp-options: -DHAS_NUM_SPARKS
build-depends: base >= 4.3 && < 6
else
build-depends: base >= 4 && < 4.3
2010-06-28 09:25:18 +04:00
build-depends:
2011-01-19 21:36:22 +03:00
ghc-prim >= 0.2 && < 0.4,
2010-07-25 21:59:01 +04:00
tag-bits >= 0.1 && < 0.2,
2011-01-19 21:36:22 +03:00
stm >= 2.1 && < 2.3,
2011-01-19 21:21:57 +03:00
transformers >= 0.2.2.0 && < 0.3,
2011-01-19 21:36:22 +03:00
containers >= 0.3.0 && < 0.5,
2010-06-28 09:25:18 +04:00
test-framework >= 0.2.4 && < 0.3,
test-framework-quickcheck >= 0.2.4 && < 0.3,
test-framework-hunit >= 0.2.4 && < 0.3,
QuickCheck >= 1.2.0.0 && < 1.3,
HUnit >= 1.2.2.1 && < 1.3
other-modules:
2011-01-19 21:21:57 +03:00
Data.Speculation
Data.Speculation.Cont
Data.Speculation.Morphism
Data.Speculation.Foldable
Data.Speculation.Traversable
Data.Speculation.List
Data.Speculation.Internal
2010-06-28 09:25:18 +04:00
executable benchmark-speculation
main-is: Benchmark.hs
if !flag(benchmarks)
buildable: False
else
2010-06-28 10:56:14 +04:00
ghc-options: -Wall -threaded
2010-06-28 09:25:18 +04:00
if flag(optimize)
ghc-options: -O2 -fspec-constr -funbox-strict-fields -fdicts-cheap
2011-01-19 21:21:57 +03:00
if flag(HasNumSparks)
cpp-options: -DHAS_NUM_SPARKS
build-depends: base >= 4.3 && < 6
else
build-depends: base >= 4 && < 4.3
2010-06-28 09:25:18 +04:00
build-depends:
2011-01-19 21:36:22 +03:00
ghc-prim >= 0.2 && < 0.4,
2011-01-19 21:21:57 +03:00
transformers >= 0.2.2.0 && < 0.3,
2010-07-25 21:59:01 +04:00
tag-bits >= 0.1 && < 0.2,
2011-01-19 21:36:22 +03:00
stm >= 2.1 && < 2.3,
containers >= 0.3.0 && < 0.5,
2010-06-28 09:25:18 +04:00
criterion >= 0.5 && < 0.6
other-modules:
2011-01-19 21:21:57 +03:00
Data.Speculation
Data.Speculation.Cont
Data.Speculation.Morphism
Data.Speculation.Foldable
Data.Speculation.Traversable
Data.Speculation.List
Data.Speculation.Internal