Implementing recursive functions as processor farms
Parallel Computing
The Definition of Standard ML
Skeleton realisations from functional prototypes
Patterns and skeletons for parallel and distributed computing
Discovering applications of higher order functions through proof planning
Formal Aspects of Computing
Hi-index | 0.00 |
The PMLS parallelizing compiler for Standard ML is based upon the automatic instantiation of algorithmic skeletons at sites of higher order function use. PMLS seeks to optimise run-time parallel be- haviour by combining skeleton cost models with Structural Operational Semantics rule counts for HOF argument functions. In this paper, the formulation of a general rule count cost model as a set of over-determined linear equations is discussed, and their solution by singular value decom- position, and by a genetic algorithm, are presented.