Special Issue High Performance Parallel Functional Programming

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...

Full description

Saved in:
Bibliographic Details
Published inJournal of functional programming Vol. 15; no. 3; pp. 351 - 352
Main Author TRINDER, P. W.
Format Journal Article
LanguageEnglish
Published Cambridge, UK Cambridge University Press 01.05.2005
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary: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.
Bibliography:PII:S0956796805005496
ark:/67375/6GQ-C0HHZNP2-B
istex:969B0F1AADA0DF6B3AF13C5819714759C6D8F3BA
ISSN:0956-7968
1469-7653
DOI:10.1017/S0956796805005496