The use of aFP to design regular array algorithms

Abstract

The authors introduce a language called aFP (array FP), which is a dialect of FP containing many desirable parallel constructs. It extends FP with additional primitive functions and higher-order functions for the purpose of designing regular arrays. In aFP, the authors describe algorithms in a parallel way to a large degree. The authors give the mappings of aFP functions together with input patterns to regular array structures. The mapped basic array algorithms can then be used as building blocks to construct more complex ones. In addition, aFP can be adapted to be a programming language in programmable systolic systems.<>