Special Issue High Performance Parallel Functional Programming

  • Authors:
  • P. W. Trinder

  • Affiliations:
  • School of Mathematics and Computer Science, Heriot-Watt University, Riccarton, Edinburgh EH14 4AS, Scotland (e-mail: trinder@macs.hw.ac.uk)

  • Venue:
  • Journal of Functional Programming
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Engineering high-performance parallel programs is hard: not only must a correct, efficient and inherently-parallel algorithm be developed, but the computations must be effectively and efficiently coordinated across multiple processors. It has long been recognised that ideas and approaches drawn from functional programming may be particularly applicable to parallel and distributed computing (e.g. Wegner 1971). There are several reasons for this suitability. Concurrent stateless computations are much easier to coordinate, high-level coordination abstractions reduce programming effort, and declarative notations are amenable to reasoning, i.e. to optimising transformations, derivation and performance analysis.