Supporting Dynamic Data Structures in a Shared-Memory based GPGPU Programming Framework

2012 ◽  
Author(s):  
Kazuhiko Ohno ◽  
Masaki Matsumoto ◽  
Tomoharu Kamiya ◽  
Takanori Maruyama
Keyword(s):  
Shared Memory ◽  
Data Structures ◽  
Dynamic Data Structures ◽  
Dynamic Data ◽  
Programming Framework

${\mathsf{eskimo}}$: EXPERIMENTING WITH SKELETONS IN THE SHARED ADDRESS MODEL

2003 ◽  
Vol 13 (03) ◽  
pp. 449-460 ◽  
Author(s):  
MARCO ALDINUCCI
Keyword(s):  
Parallel Programming ◽  
Shared Memory ◽  
Data Structures ◽  
Programming Models ◽  
Dynamic Data Structures ◽  
Dynamic Data ◽  
Programming Frameworks

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 [Formula: see text] library which represents an attempt to merge the two programming models by introducing skeletons in a shared memory framework.

Sign in / Sign up

Export Citation Format

Share Document