fpnla-examples

Example implementations for FPNLA library

Latest on Hackage:

0.1.1

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

BSD-3-Clause licensed by Mauro Blanco, Pablo Perdomo, Pablo Ezzatti, Alberto Pardo, Marcos Viera

Maintained by Pablo Perdomo, Mauro Blanco

This package provides many example implementations of the operations defined in package fpnla (http://hackage.haskell.org/package/fpnla) using various data structures and algorithms.

IMPORTANT: Many algorithms are only partially implemented

The structures currently used are:

hmatrix http://hackage.haskell.org/package/hmatrix
vector http://hackage.haskell.org/package/vector
array http://hackage.haskell.org/package/array
repa arrays http://hackage.haskell.org/package/repa
accelerate arrays http://hackage.haskell.org/package/accelerate
array http://hackage.haskell.org/package/array
Haskell lists http://hackage.haskell.org/package/base-4.6.0.1/docs/Data-List.html

Operations are parallelized using the parallel framework (http://hackage.haskell.org/package/parallel), Monad-Par (http://hackage.haskell.org/package/monad-par), Repa (http://hackage.haskell.org/package/repa) and Accelerate (http://hackage.haskell.org/package/accelerate).

Details about the package may be found in the paper: Towards a functional run-time for dense NLA domain. In Proceedings of the 2Nd ACM SIGPLAN Workshop on Functional High-performance Computing. New York, NY, USA. ACM, pages 85-96 (http://www.fing.edu.uy/~mviera/papers/fhpc13.pdf).