knead: Repa array processing using LLVM JIT
This library processes arrays like
but it uses the just-in-time compiler of
for generating the machine code.
That is, you get very efficient vectorised code
that can be run without a GPU.
You do not need to care about inlining and strictness annotations,
because the LLVM code is by default inlined and strict.
The package is the basis for an LLVM backend for the
Very flexible index handling, even more flexible than the one of
Data.Array. It is much more expressive and type-safe than that of
Extensible element types, e.g. complex numbers. (Maybe this is also possible with accelerate, e.g. with RGB type.)
Every compilable program also runs. In contrast to that,
acceleratemay accept a program that cannot be run by a particular backend, like
The functions do not check array bounds. (Of course, we can think about temporary bound checking for debugging purposes.)
The package does not try to distribute work across multiple processors. It is certainly simpler, more efficient and more reliable if you do that at a higher level.
The name of the package is inspired by the visualization of typical operations like reshaping, collapsing a dimension and extruding another one.
|Versions||0.2, 0.2.0.1, 0.2.1, 0.2.2, 0.2.3 (info)|
|Dependencies||base (==4.*), llvm-extra (>=0.7.1 && <0.8), llvm-tf (==3.1.*), storable-record (>=0.0.3 && <0.1), storable-tuple (==0.0.*), transformers (>=0.3 && <0.6), utility-ht (>=0.0.1 && <0.1) [details]|
|Author||Henning Thielemann <firstname.lastname@example.org>|
|Maintainer||Henning Thielemann <email@example.com>|
|Source repo||this: darcs get http://hub.darcs.net/thielema/knead/ --tag 0.2.1
head: darcs get http://hub.darcs.net/thielema/knead/
|Uploaded||by HenningThielemann at Sun Mar 19 21:04:52 UTC 2017|
|Downloads||865 total (19 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
For package maintainers and hackage trustees