An Algorithm Template for Domain-Based Parallel Irregular Algorithms

The parallelization of irregular algorithms has not been as widely studied as the one of regular codes. In particular, while there are many proposals of parallel skeletons and libraries very well suited to regular algorithms, this is not the case for irregular ones. This is probably due to the compl...

Full description

Saved in:
Bibliographic Details
Published in:International journal of parallel programming Vol. 42; no. 6; pp. 948 - 967
Main Authors: González, Carlos H., Fraguela, Basilio B.
Format: Journal Article
Language:English
Published: Boston Springer US 01.12.2014
Springer Nature B.V
Subjects:
Algorithms
Analysis
Computation
Computer programming
Computer Science
Libraries
Parallel processing
Processor Architectures
Programming
Programming languages
Semantics
Software Engineering/Programming and Operating Systems
Studies
System built
Tasks
Theory of Computation
Parallel skeletons
Libraries
Amorphous parallelism
ISSN:0885-7458, 1573-7640
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The parallelization of irregular algorithms has not been as widely studied as the one of regular codes. In particular, while there are many proposals of parallel skeletons and libraries very well suited to regular algorithms, this is not the case for irregular ones. This is probably due to the complexity of finding common patterns, behaviors and semantics in these algorithms. This is unfortunate, as the parallelization of irregular algorithms would benefit even more than that of regular codes from the higher degree of abstraction provided by skeletons. This work proposes to exploit the concept of domain defined on some property of the elements to process in order to enable the simple and effective parallelization of irregular applications. Namely, we propose to use such domains both to decompose the computations in parallel tasks and to detect and avoid conflicts between these tasks. A generic C++ library providing a skeleton for multicore systems built on this idea is described and evaluated. Our experimental results show that this library is a very practical tool for the parallelization of irregular algorithms with little programming effort.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0885-7458
1573-7640
DOI:10.1007/s10766-013-0268-3