Parallel Programming Using Skeleton Functions
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Patterns and skeletons for parallel and distributed computing
Patterns and skeletons for parallel and distributed computing
An advanced environment supporting structured parallel programming in Java
Future Generation Computer Systems - Tools for program development and analysis
Algorithmic skeletons: a structured approach to the management of parallel computation
Algorithmic skeletons: a structured approach to the management of parallel computation
A library of constructive skeletons for sequential style of parallel programming
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
QUAFF: efficient C++ design for parallel skeletons
Parallel Computing - Algorithmic skeletons
Data parallel Haskell: a status report
Proceedings of the 2007 workshop on Declarative aspects of multicore programming
MEDEA '07 Proceedings of the 2007 workshop on MEmory performance: DEaling with Applications, systems and architecture
Flexible skeletal programming with eskel
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Fine tuning algorithmic skeletons
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
MCSTL: the multi-core standard template library
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A software architecture for parallel list processing on grids
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
Hi-index | 0.00 |
Skeletal parallel programming is a promising solution to simplify parallel programming. The approach involves providing generic and recurring data structures like lists and parallel computation patterns as skeletons that conceal parallel behaviors. However, when we focus on lists, which are usually implemented as one-dimensional arrays, their length is restricted and fixed in existing data parallel skeleton libraries. Due to this restriction, many problems cannot be coded using parallel skeletons. To resolve this problem, this paper proposes parallel skeletons for lists of variable lengths and their implementation within a parallel skeleton library called SkeTo. The proposed skeletons enable us to solve a wide range of problems including those of twin primes, Knight's tour, and Mandelbrot set calculations with SkeTo. We tested and confirmed the efficiency of our implementation of variable-length lists through various experiments.