Upon the performance of a Haskell parallel implementation

Abstract

The Haskell developers focus on providing an open range of packages and libraries in various research areas. Particularly, image processing is naturally expressed in terms of parallel array operations and we use here Repa as a great tool for coding image manipulation algorithms. Our target is to analyze the execution time of a Haskell parallel implementation and also to compare the results to the appropriate C++ implementation. A certain example from the image processing area of interest is selected. The conclusion is that the compared execution time values depend both on the physic and the logic parameters of the applied solutions.