Work

A pattern language for parallelizing irregular algorithms

Year: 2010

Type: conference-paper

Abstract: In irregular algorithms, data set's dependences and distributions cannot be statically predicted. This class of algorithms tends to organize computations in terms of data locality instead of parallelizing control in multiple threads. Thus, opportunities for exploiting parallelism vary dynamically, according to how the algorithm changes data dependences. This paper presents the first part of a pattern language for creating parallel implementations of irregular algorithms and applications. Four patterns are proposed: Amorphous Data-Parallelism, Data-Parallel Graph, Optimistic Iteration and In-Order Iteration.

DOI: 10.1145/1953611.1953624

Authors: Pedro Monteiro, Miguel P. Monteiro

Institution: Universidade Nova de Lisboa

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Fundação para a Ciência e a Tecnologia

Award: G7802921035

OpenAlex ID: W2024266283