Exceptions for Algorithmic Skeletons
نویسندگان
چکیده
Algorithmic Skeletons offer high-level abstractions for parallel programming based on recurrent parallelism patterns. Patterns can be combined and nested into more complex parallelism behaviors. Programmers fill the skeleton patterns with the functional (business) code, which transforms the generic skeleton into a specific application. However, when the functional code generate exceptions, this exposes the programmer to details of the skeleton library, breaking the high-level abstraction principle. Furthermore, related parallel activities must be stopped as the exception is raised. This paper describes how to handle exceptions in Algorithmic Skeletons without breaking the high-level abstractions of the programming model. We describe both the behavior of the framework in a formal way, and its implementation in Java: the Skandium Library.
منابع مشابه
Parallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملTowards the Classi cation of Algorithmic Skeletons
Algorithmic skeletons are seen as being high level parallel programming language constructs encapsulating the expression of parallelism communication synchronisa tion embedding and costing This report examines the classi cation of algorithmic skeletons proposing one classi cation and examining others which have been devised Various algorithmic skeletons are examined and these are categorised to...
متن کاملA Scheme for Nesting Algorithmic Skeletons
A scheme for arbitrary nesting of algorithmic skeletons is explained which is based on the idea of groups in MPI. The scheme is part of a semi-automatic compilation system which generates parallel code for nested HOFs. Two skeletons were developed which run in a nested mode: a binary divide and conquer and a process farm for a parallel implementation of fold and map HOFs respectively. Examples ...
متن کاملA Survey of Cost Models for Algorithmic Skeletons
This report presents a survey of performance models for parallel al-gorithmic skeletons. First, higher-order functions (HOFs) are presented according to the modelled skeletons. Next, the corresponding parallel implementations (skeletons) for the HOFs are discussed with the performance models that were constructed for the skeletons.
متن کامل