DMCA
On the Effectiveness of Functional Language Features: NAS benchmark FT (1997)
| Venue: | Journal of Functional Programming |
| Citations: | 8 - 1 self |
BibTeX
@ARTICLE{Hammes97onthe,
author = {J. Hammes and S. Sur and W. Böhm and W. B Ohm},
title = {On the Effectiveness of Functional Language Features: NAS benchmark FT},
journal = {Journal of Functional Programming},
year = {1997},
volume = {7},
pages = {103--123}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we investigate the effectiveness of functional language features when writing scientific codes. Our programs are written in the purely functional subset of Id and executed on a one node Motorola Monsoon machine, and in Haskell and executed on a Sparc 2. In the application we study -- the NAS FT benchmark, a three-dimensional heat equation solver -- it is necessary to target and select one-dimensional sub-arrays in three-dimensional arrays. Furthermore, it is important to be able to share computation in array definitions. We compare first order and higher order implementations of this benchmark. The higher order version uses functions to select one-dimensional sub-arrays, or slices, from a three-dimensional object, whereas the first order version creates copies to achieve the same result. We compare various representations of a three-dimensional object, and study the effect of strictness in Haskell. We also study the performance of our codes when employing recursive and it...
Keyphrases
functional language feature na benchmark ft three-dimensional object one-dimensional sub-arrays share computation three-dimensional heat equation solver scientific code order version purely functional subset three-dimensional array node motorola monsoon machine first order na ft benchmark order implementation various representation first order version array definition
