Task Parallel Skeletons for Irregularly Structured Programs
نویسنده
چکیده
The integration of a task parallel skeleton into a functional programming language is presented. Task parallel skeletons, as other algorithmic skeletons, represent general parallelization patterns. They are introduced into otherwise sequential languages to enable the development of parallel applications. Into functional programming languages, they naturally are integrated as higher-order functional forms. We show by means of the example branch-and-bound that the introduction of task parallel skeletons into a functional programming language is advantageous with regard to the comfort of programming, achieving good computation performance at the same time.
منابع مشابه
Parallel Programming with Tree Skeletons
Parallel computing is an essential technique to deal with large scaled problems. In recent years, while hardware for parallel computing is getting widely available, developing software for parallel computing remains as a hard task for many programmers. The main difficulties are caused by the communication, synchronization, and data distribution required in parallel programs. This thesis studies...
متن کامل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...
متن کاملImplementing Algorithmic Skeletons over Hadoop
In the past few years, there has been a growing interest for storing and processing vast amounts of data that many times exceed the Petabyte limit. To that end, MapReduce, a computational paradigm that was introduced by Google in 2003, has become particularly popular. It provides a simple interface with two functions, map and reduce for developing and implementing scalable parallel applications...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Design and Implementation of General Tree Skeletons
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficient parallel programs manipulating trees of arbitrary shapes, because of their irregular and ill-balanced structures. In this paper, we propose a solution for them based on the skeletal approach, in particular for genera...
متن کامل