eskimo: experimenting skeletons on the shared address model
We discuss the lack of expressivity in some skeleton-based parallel programming frameworks. The problem is further exacerbated when approaching irregular problems and dealing with dynamic data structures. Shared memory programming has been argued to have substantial ease of programming advantages fo...
Main Author: | |
---|---|
Other Authors: | |
Format: | Conference Object |
Language: | English |
Published: |
Université d'Orléans
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/2318/59937 http://www.di.unipi.it/~aldinuc/paper_files/2003_eskimo_ppl.pdf http://www.di.unito.it/~aldinuc |
Summary: | We discuss the lack of expressivity in some skeleton-based parallel programming frameworks. The problem is further exacerbated when approaching irregular problems and dealing with dynamic data structures. Shared memory programming has been argued to have substantial ease of programming advantages for this class of problems. We present the eskimo library which represents an attempt to merge the two programming models by introducing skeletons in a shared memory framework. |
---|