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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blume, B., Eigenmann, R., Faigin, K., Grout, J., Hoeflinger, J., Padua, D., Petersen, P., Pottenger, B., Rauchwerger, L., Tu, P., Weatherford, S.: Polaris: The next generation in parallelizing compilers. In: Proc. of the Workshop on Languages and Compilers for Parallel Computing, pp. 10–1. Springer, Heidelberg (1994)
Chakrabarti, D.R., Shenoy, N., Choudhary, A.N., Banerjee, P.: An Efficient Uniform Run-time Scheme for Mixed Regular-irregular Applications. In: Proc. of the Int. Conf. on Supercomputing, Melbourne, Australia, July 1998, pp. 61–68 (1998)
Crummey, J.M., Whalley, D., Kennedy, K.: Improving Memory Hierarchy Performance for Irregular Applications Using Data and Computation Reorderings. Int. J. Parallel Program. 29(3), 217–247 (2001)
Han, H., Tseng, C.-W.: Improving Locality for Adaptive Irregular Scientific Codes. In: Midkiff, S.P., Moreira, J.E., Gupta, M., Chatterjee, S., Ferrante, J., Prins, J.F., Pugh, B., Tseng, C.-W. (eds.) LCPC 2000. LNCS, vol. 2017, pp. 173–188. Springer, Heidelberg (2001)
Plimpton, S.: Fast parallel algorithms for short-range molecular dynamics. J. Comp. Phys. 117, 1–19 (1995)
Radons, G., Yang, H.L.: Static and Dynamic Correlations in Many-Particle Lyapunov Vectors, nlin.cd/0404028, and references therein
Rünger, G., Schwind, M.: Cache optimization for mixed regular and irregular computations. In: Proc. of the POHLL 2008 Workshop on Performance Optimization for High-Level Languages and Libraries (POHLL 2008). IEEE, Los Alamitos (2008)
Strout, M.M., Hovland, P.D.: Metrics and models for reordering transformations. In: Proc. of the The Second ACM SIGPLAN Workshop on Memory System Performance (MSP), June 8, pp. 23–34 (2004)
Ujaldon, M., Zapata, E.L.: Efficient Resolution of Sparse Indirections in Data-Parallel Compilers. In: Proc. of the Int. Conf. on Supercomputing, Barcelona, Spain, July 1995, pp. 117–126 (1995)
Warren, M.S., Salmon, J.K.: A parallel hashed Oct-Tree N-body algorithm. In: Supercomputing 1993: Proceedings of the 1993 ACM/IEEE conference on Supercomputing, pp. 12–21. ACM, New York (1993)
Yang, H., Radons, G.: Lyapunov instabilities of Lennard-Jones fluids. Phys. Rev. E 71(3), 036211 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rünger, G., Schwind, M. (2009). Parallelization Strategies for Mixed Regular-Irregular Applications on Multicore-Systems. In: Dou, Y., Gruber, R., Joller, J.M. (eds) Advanced Parallel Processing Technologies. APPT 2009. Lecture Notes in Computer Science, vol 5737. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03644-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-03644-6_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03643-9
Online ISBN: 978-3-642-03644-6
eBook Packages: Computer ScienceComputer Science (R0)