OpenMP tasking analysis for programmers

Authors:
Xavier Teruel;Christopher Barton;Alejandro Duran;Xavier Martorell;Eduard Ayguadé;Priya Unnikrishnan;Guansong Zhang;Raul Silvera
Affiliations:
Barcelona Supercomputing Center - Universitat Politècnica de Catalunya, Barcelona, Spain;IBM Toronto Laboratory, Markham, Ontario, Canada;Barcelona Supercomputing Center - Universitat Politècnica de Catalunya, Barcelona, Spain;Barcelona Supercomputing Center - Universitat Politècnica de Catalunya, Barcelona, Spain;Barcelona Supercomputing Center - Universitat Politècnica de Catalunya, Barcelona, Spain;IBM Toronto Laboratory, Markham, Ontario, Canada;IBM Toronto Laboratory, Markham, Ontario, Canada;IBM Toronto Laboratory, Markham, Ontario, Canada
Venue:
CASCON '09 Proceedings of the 2009 Conference of the Center for Advanced Studies on Collaborative Research
Year:
2009

Citing 11
Cited 2

Optimal parallel merging and sorting without memory conflicts

IEEE Transactions on Computers
Implementing Quicksort programs

Communications of the ACM
A microbenchmark suite for OpenMP 2.0

ACM SIGARCH Computer Architecture News - Special Issue: PACT 2001 workshops
Performance characteristics of openMP constructs, and application benchmarks on a large symmetric multiprocessor

ICS '03 Proceedings of the 17th annual international conference on Supercomputing
Support for OpenMP tasks in Nanos v4

CASCON '07 Proceedings of the 2007 conference of the center for advanced studies on Collaborative research
An adaptive cut-off for task parallelism

Proceedings of the 2008 ACM/IEEE conference on Supercomputing
OpenMP tasks in IBM XL compilers

CASCON '08 Proceedings of the 2008 conference of the center for advanced studies on collaborative research: meeting of minds
The Design of OpenMP Tasks

IEEE Transactions on Parallel and Distributed Systems
Barcelona OpenMP Tasks Suite: A Set of Benchmarks Targeting the Exploitation of Task Parallelism in OpenMP

ICPP '09 Proceedings of the 2009 International Conference on Parallel Processing
CLOMP: accurately characterizing OpenMP application overheads

IWOMP'08 Proceedings of the 4th international conference on OpenMP in a new era of parallelism
Evaluation of OpenMP task scheduling strategies

IWOMP'08 Proceedings of the 4th international conference on OpenMP in a new era of parallelism

Computing on multi-core platform: performance issues

Proceedings of the 2011 International Conference on Communication, Computing & Security
A microbenchmark suite for OpenMP tasks

IWOMP'12 Proceedings of the 8th international conference on OpenMP in a Heterogeneous World

Quantified Score

Hi-index	0.00

Visualization

Abstract

As of 2008, the OpenMP 3.0 standard includes task support allowing programmers to exploit irregular parallelism. Although several compilers are providing support for this new feature there has not been extensive investigation into the real possibilities of this extension. Several papers have discussed the programming model itself while other papers have discussed design and implementation on different platforms. There are also papers demonstrating performance results using well known kernel applications. This paper presents an analysis of the OpenMP tasking model possibilities, using the IBM XL compiler implementation. Using different parameters such as the number of tasks, task granularity and parallelism pattern, this paper explores how such parameters can affect the average performance and identifies the limits of the OpenMP tasking model.