Features from functional programming for a C++ skeleton library
Concurrency and Computation Practice and ExperiencePublished 23 February 2005
Herbert Kuchen, Jörg Striegnitz
Citations13
SJR quartileQ2
SJR score0.44
SNIP0.68
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
How C++ templates and operator overloading can be used in order to provide the main features needed for algorithmic skeletons, namely higher‐order functions, partial applications and parametric polymorphism is described.
Abstract
Abstract Message passing based on libraries such as MPI is typically used to program parallel machines with distributed memory. This is efficient, but error prone. Algorithmic skeletons are intended to simplify parallel programming by increasing expressive power. The idea is to offer typical parallel programming patterns as polymorphic higher‐order functions which are efficiently implemented in parallel. The present paper describes how C++ templates and operator overloading can be used in order to provide the main features needed for algorithmic skeletons, namely higher‐order functions, partial applications and parametric polymorphism. Experimental results based on a draft implementation of our C++ skeleton library show that higher expressive power can be gained without a significant performance penalty. Copyright © 2005 John Wiley & Sons, Ltd.
Keywords
Computer Science
CERN Document Server (European Organization for Nuclear Research)Algorithmic skeletons : structured management of parallel computation
876 Citations1989Murray Cole
This book introduces a new approach to the design and implementation of software systems which will help users of large scale parallel systems coordinate many concurrent activities toward a single goal and proposes a selection of independent algorithmic skeletons which describes the structure of a particular style of algorithm.
ACM SIGPLAN Fortran ForumHigh performance Fortran language specification
820 Citations1993CORPORATE Rice University
Medical Entomology and ZoologyParallel Computing: Theory and Practice
436 Citations1994Michael J. Quinn
Graph theoretic terminology review of complex numbers parallel algorithm design strategies and how to design parallel algorithms for linear systems and multiprocessors.
Lecture notes in computer scienceParallel programming using skeleton functions
275 Citations1993John Darlington, A. J. Field +5 more
Performance will be generally poor unless the issue of resource allocation is addressed explicitly, diminishing the advantage of using a functional language in the first place.
Lecture notes in computer scienceA Skeleton Library
160 Citations2002Herbert Kuchen
The idea is to offer typical parallel programming patterns as polymorphic higher-order functions which are efficiently implemented in parallel as a library which can easily be used by e.g. C and C++ programmers.
Cambridge University Press eBooksFoundations of Parallel Programming
145 Citations1994David B. Skillicorn
The key idea is to develop parallel software development using lists, and to build categorical data types for lists, bags and finite sets.
Lecture notes in computer scienceFunctional skeletons for parallel coordination
72 Citations1995John Darlington, Yike Guo +2 more
This paper proposes a methodology for structured parallel programming using functional skeletons to compose and coordinate concurrent activities written in a standard imperative language and shows how such forms can be used uniformly to abstract all aspects of a parallel program's behaviour.
HPC++
60 Citations1997Elizabeth Johnson, Dennis Gannon
This paper describes an initial implementation of the HPC++ Parallel Standard Template Library (PSTL) framework, which includes seven distributed containers as well as selected algorithms.
Lecture notes in computer scienceArray Design and Expression Evaluation in POOMA II
52 Citations1998Steve Karmesin, J.A. Crotinger +6 more
The representation of expressions is kept separate from expression evaluation, allowing the use of multiple evaluator mechanisms that can support nested where-block constructs, hardware-specific optimizations and different run-time environments.
Lecture notes in computer scienceSkeletons for data parallelism in p31
41 Citations1997Marco Danelutto, Fabrizio Pasqualetti +1 more
The new set of p31 data parallel skeletons are described, the implementation templates used to compile data parallel computations are outlined, and the template based compiling process and the optimizations that can be carried on are discussed.
Theoretical Computer ScienceEfficient high-level parallel programming
39 Citations1998George Horaţiu Botorog, Herbert Kuchen
A new approach to programming with skeletons is presented, which integrates the skeletons into an imperative host language enhanced with higher-order functions and currying, as well as with a polymorphic type system, to obtain a high-level programming language, which can be implemented very efficiently.
Lecture notes in computer scienceEfficient parallel programming with algorithmic skeletons
37 Citations1996George Horaţiu Botorog, Herbert Kuchen
A new approach to programming with skeletons is presented, which integrates the skeletons into an imperative host language enhanced with higher-order functions and currying, as well as with a polymorphic type system, to obtain a high-level programming language which can be implemented very efficiently.
Parallel Processing LettersTHE INTEGRATION OF TASK AND DATA PARALLEL SKELETONS
28 Citations2002Herbert Kuchen, Murray Cole
A skeletal parallel programming library which integrates task and data parallel constructs within an API for C++ and a case study describing two algorithms for the travelling salesman problem are presented.
Lecture notes in computer scienceEfficient distributed memory implementation of a data parallel functional language
20 Citations1994Herbert Kuchen, Rinus Plasmeijer +1 more
The approach is to support data parallelism by providing a set of primitives on arrays which allow the user to control the parallelism and communication on a high level, disabling problems like deadlocks.