Workload Decomposition Strategies for Shared Memory Parallel Systems with OpenMP

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...

Full description

Saved in:
Bibliographic Details
Published in:Scientific programming 2001-01, Vol.9 (2-3), p.109-122
Main Authors: Di Martino, Beniamino, Briguglio, Sergio, Vlad, Gregorio, Fogaccia, Giuliana
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1058-9244
1875-919X
DOI:10.1155/2001/891073