knead
Version 1.0.1.1 revision 0 uploaded by HenningThielemann.
Package meta
- Synopsis
- Repa-like array processing using LLVM JIT
- Description
This library processes arrays like
Repa
andAccelerate
, but it uses the just-in-time compiler ofLLVM
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 intended as the basis for an LLVM backend for theAccelerate
framework.Highlights:
Very flexible index handling, even more flexible than the one of Data.Array. It is much more expressive and type-safe than that of
repa
andarray
.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,
accelerate
may accept a program that cannot be run by a particular backend, likeaccelerate-cuda
.
Known deficiencies:
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.
- Author
- Henning Thielemann <haskell@henning-thielemann.de>
- Bug reports
- n/a
- Category
- Data Structures
- Copyright
- n/a
- Homepage
- https://hub.darcs.net/thielema/knead/
- Maintainer
- Henning Thielemann <haskell@henning-thielemann.de>
- Package URL
- n/a
- Stability
- n/a