The rcu package

[ Tags: benchmark, bsd3, data, library, program ] [ Propose Tags ]

Read-Copy-Update for Haskell


[Skip to Readme]

Properties

Versions 0, 0.1, 0.2, 0.2.1
Change log CHANGELOG.markdown
Dependencies atomic-primops (>=0.8), base (>=4.8 && <5), ghc-prim (>=0.3), parallel (==3.2.*), primitive (>=0.6), rcu, transformers (>=0.4 && <0.6) [details]
License BSD3
Copyright Copyright (C) 2015 Edward A. Kmett, Theodore Rhys Cooper
Author Ted Cooper and Edward A. Kmett
Maintainer Edward A. Kmett <ekmett@gmail.com>, Ted Cooper <anthezium@gmail.com>
Category Data
Home page http://github.com/ekmett/rcu/
Bug tracker http://github.com/ekmett/rcu/issues
Source repository head: git clone git://github.com/ekmett/rcu.git
Uploaded Fri Jul 28 23:35:21 UTC 2017 by ryanglscott
Updated Thu Aug 3 14:57:33 UTC 2017 by ryanglscott to revision 1   [What is this?]
Distributions NixOS:0.2.1
Executables MoveStringGC, MoveStringQSBR, MoveStringSTM
Downloads 357 total (6 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-07-28 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Flags

NameDescriptionDefaultType
test-doctestsEnabledManual
test-hlintEnabledManual
unstableDisabledManual
measure-synchronizeDisabledManual

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees


Readme for rcu-0.2.1

[back to package description]

rcu

Hackage Build Status

This package is an exploration of Read-Copy Update in Haskell based on Relativistic Programming in Haskell by Cooper and Walpole. It includes a sound QSBR-based implementation and an attempt at an STM-based implementation.

In the spirit of A Relativistic Enhancement to Software Transactional Memory by Howard and Walpole, we could extend the STM implementation to allow reads and writes on the same data in parallel, writes to disjoint data in parallel, and force readers to agree that writes before a synchronize happened before writes after it.

Development on this project proceeded in a burst of enthusiasm after Edward saw Ted's poster presentation at ICFP 2015, and yet somehow he managed to shanghai Ted into helping maintain this copy of his own work.

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact us through github or on the #haskell IRC channel on irc.freenode.net.

-Edward Kmett and Ted Cooper