Workload decomposition strategies for hierarchical distributed-shared memory parallel systems and their implementation with integration of high-level parallel languages

2002 ◽  
Vol 14 (11) ◽  
pp. 933-956 ◽  
Author(s):  
Sergio Briguglio ◽  
Beniamino Di Martino ◽  
Gregorio Vlad
2001 ◽  
Vol 9 (2-3) ◽  
pp. 109-122 ◽  
Author(s):  
Beniamino Di Martino ◽  
Sergio Briguglio ◽  
Gregorio Vlad ◽  
Giuliana Fogaccia

A crucial issue in parallel programming (both for distributed and shared memory architectures) is work decomposition. Work decomposition task can be accomplished without large programming effort with use of high-level parallel programming languages, such as OpenMP. Anyway particular care must still be payed on achieving performance goals. In this paper we introduce and compare two decomposition strategies, in the framework of shared memory systems, as applied to a case study particle in cell application. A number of different implementations of them, based on the OpenMP language, are discussed with regard to time efficiency, memory occupancy, and program restructuring effort.


2010 ◽  
Vol 38 (1) ◽  
pp. 347-358 ◽  
Author(s):  
Isaac Gelado ◽  
John E. Stone ◽  
Javier Cabezas ◽  
Sanjay Patel ◽  
Nacho Navarro ◽  
...  

2010 ◽  
Vol 45 (3) ◽  
pp. 347-358 ◽  
Author(s):  
Isaac Gelado ◽  
John E. Stone ◽  
Javier Cabezas ◽  
Sanjay Patel ◽  
Nacho Navarro ◽  
...  

2020 ◽  
Vol 30 (2) ◽  
pp. 1-26 ◽  
Author(s):  
Matteo Principe ◽  
Tommaso Tocci ◽  
Pierangelo Di Sanzo ◽  
Francesco Quaglia ◽  
Alessandro Pellegrini

Sign in / Sign up

Export Citation Format

Share Document