# PIT

PIT: A library for the parallelization of irregular problems. A problem is irregular if its solution requires the computation of some properties for each of a set of elements irregularly distributed in a domain of interest. These problems satisfy a locality property because the properties of an element depend upon those of a few other elements, its neighbors, according to a dynamic, problem dependent stencil. The development of parallel algorithms for irregular problems on distributed memory architectures is not trivial, because the irregularity and the dinamicity of the distribution of the elements in the domain require complex strategies to manage the mapping of elements onto the processing nodes and to implement the processing nodes cooperation. This paper introduces PIT, a library to simplify the parallelization of irregular problems. The key assumption underlying the definition of PIT is that both the sequential and the parallel version of the application are structured in terms of operations on a tree that describes the distribution of the elements in the domain. In the parallel version, the tree is handled in parallel through the functions supplied by PIT in a way that is transparent to the user and that preserves most of the sequential code.

## References in zbMATH (referenced in 1 article , 1 standard article )

Showing result 1 of 1.

Sorted by year (