Parallelization Strategies for Mixed Regular-Irregular Applications on Multicore-Systems

Authors:
Gudula Rünger;Michael Schwind
Affiliations:
Department of Computer Science, Chemnitz University of Technology, Germany;Department of Computer Science, Chemnitz University of Technology, Germany
Venue:
APPT '09 Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies
Year:
2009

Citing 8
Cited 0

A parallel hashed Oct-Tree N-body algorithm

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Fast parallel algorithms for short-range molecular dynamics

Journal of Computational Physics
Efficient resolution of sparse indirections in data-parallel compilers

ICS '95 Proceedings of the 9th international conference on Supercomputing
An efficient uniform run-time scheme for mixed regular-irregular applications

ICS '98 Proceedings of the 12th international conference on Supercomputing
Improving Memory Hierarchy Performance for Irregular Applications Using Data and Computation Reorderings

International Journal of Parallel Programming
Improving Locality for Adaptive Irregular Scientific Codes

LCPC '00 Proceedings of the 13th International Workshop on Languages and Compilers for Parallel Computing-Revised Papers
Polaris: Improving the Effectiveness of Parallelizing Compilers

LCPC '94 Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing
Metrics and models for reordering transformations

MSP '04 Proceedings of the 2004 workshop on Memory system performance

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scientific simulation codes often exhibit a mixed structure of regular and irregular data accesses. Since the organization of data accesses has a large influence on the overall performance of parallel code, a careful planning of parallelism is required. In this article, we consider a mixed regular-irregular particle simulation code and investigate several parallelization strategies for multicore architectures consisting of several multicore processors in a shared memory system. The interaction of irregular and regular data accesses are the specific challenge for a cache optimized parallel multicore-code. We present performance experiments on three different multicore systems and show that a mixture of parallelization techniques for irregular and regular applications leads to the best performance.