Runtime characterisation of irregular accesses applied to parallelisation of irregular reductions

Authors:
David E. Singh;Maria J. Martin;Francisco F. Rivera
Affiliations:
Department of Computer Science, University Carlos III of Madrid, Spain.;Department of Electronics and Systems, University of A Coruna, Spain.;Department of Electronics and Computer Science, University of Santiago de Compostela, Spain
Venue:
International Journal of Computational Science and Engineering
Year:
2005

Citing 10
Cited 1

GIVE-N-TAKE—a balanced code placement framework

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Detecting coarse-grain parallelism using an interprocedural parallelizing compiler

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
On the Automatic Parallelization of the Perfect Benchmarks®

IEEE Transactions on Parallel and Distributed Systems
Improving memory hierarchy performance for irregular applications

ICS '99 Proceedings of the 13th international conference on Supercomputing
Adaptive reduction parallelization techniques

Proceedings of the 14th international conference on Supercomputing
A compiler method for the parallel execution of irregular reductions in scalable shared memory multiprocessors

Proceedings of the 14th international conference on Supercomputing
Cacheminer: A Runtime Approach to Exploit Cache Locality on SMP

IEEE Transactions on Parallel and Distributed Systems
Parallel Programming with Polaris

Computer
Maximizing Multiprocessor Performance with the SUIF Compiler

Computer
Localizing Non-Affine Array References

PACT '99 Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques

Decoupled software pipelining creates parallelization opportunities

Proceedings of the 8th annual IEEE/ACM international symposium on Code generation and optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Irregular reduction operations are the core of many large scientific and engineering applications. There are, in the literature, different methods to solve these operations in parallel. In this paper we discuss a new technique which improves performance significantly, both in terms of execution time and memory overhead. These improvements are achieved in the preprocessing as well as in the resulting parallel code. Our proposal is based on the use of the Irregular Access Region Descriptor (IARD). This data structure is a compact characterisation of indirectly accessed arrays that can be used for the efficient parallelisation of a wide spectrum of irregular codes. In this paper we present its application to parallelise irregular reduction operations on a shared memory machine. We compare our proposal with two other competitive solutions.