Algorithmic skeletons: structured management of parallel computation
Algorithmic skeletons: structured management of parallel computation
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
GUM: a portable parallel implementation of Haskell
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Structured development of parallel programs
Structured development of parallel programs
MPI: The Complete Reference
Compiling Haskell by Program Transformation: A Report from the Trenches
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Parallel functional programming at two levels of abstraction
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Parallelism abstractions in eden
Patterns and skeletons for parallel and distributed computing
Comparing Parallel Functional Languages: Programming and Performance
Higher-Order and Symbolic Computation
Testing speculative work in a lazy/eager parallel functional language
LCPC'05 Proceedings of the 18th international conference on Languages and Compilers for Parallel Computing
| Hi-index | 0.00 |
Parallel languages based on skeletons allow the programmer to abstract from implementation details, reducing the development time of the parallelizations of large applications. Unfortunately, these languages use to restrict the set of parallel patterns that can be used. The parallel functional language Eden extends the lazy functional language Haskell with expressions to define and instantiate process systems. These extensions also make possible to easily define skeletons as higher-order functions. By doing so, skeletons can be both defined and used in the same language, using a high level of abstraction. Due to these facts, the advantages of skeleton-based languages are kept in Eden, while we do not inherit the restrictions they have, as the set of skeletons can grow as needed. Moreover, in our approach the sequential code of the programs can be written in any language supporting a COM interface.