Skip to main content

Supporting Adaptive Privatization Techniques for Irregular Array Reductions in Task-Parallel Programming Models

  • Conference paper
  • First Online:
OpenMP: Memory, Devices, and Tasks (IWOMP 2016)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9903))

Included in the following conference series:

Abstract

Irregular array-type reductions represent a reoccurring algorithmic pattern in many scientific applications. Their scalable execution on modern systems is not trivial as their irregular memory access pattern prohibits an efficient use of the memory subsystem and costly techniques are needed to eliminate data races. Taking a closer look at algorithms, memory access patterns and support techniques reveals that a one-size-fits-all solution does not exist and approaches are needed that can adapt to individual properties while maintaining programming transparency. In this work we propose a solution framework that generalizes the concept of privatization to support a variety of techniques, implements an inspector-executor to provide memory access analytics to the runtime for automatic tuning and shows what language extensions are needed. A reference implementation in OmpSs, a task-parallel programming model, shows programmability and scalability of this solution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Hydrodynamics Challenge Problem, Lawrence Livermore National Laboratory. Technical report LLNL-TR-490254

    Google Scholar 

  2. A comparison of parallelization techniques for irregular reductions. In: Proceedings 15th International Parallel and Distributed Processing Symposium, p. 8, April 2001

    Google Scholar 

  3. Ciesko, J., Bueno, J., Puzovic, N., Ramirez, A., Badia, R.M., Labarta, J.: Programmable and scalable reductions on clusters. In: 2013 IEEE 27th International Symposium on Parallel Distributed Processing (IPDPS), pp. 560–568, May 2013

    Google Scholar 

  4. Ciesko, J., Mateo, S., Teruel, X., Beltran, V., Martorell, X., Labarta, J.: Boosting irregular array reductions through in-lined block-ordering on fast processors. In: High Performance Extreme Computing Conference (HPEC), pp. 1–6. IEEE, September 2015

    Google Scholar 

  5. Ciesko, J., Mateo, S., Teruel, X., Beltran, V., Martorell, X., Badia, R.M., Ayguadé, E., Labarta, J.: Task-parallel reductions in OpenMP and OmpSs. In: DeRose, L., de Supinski, B.R., Olivier, S.L., Chapman, B.M., Müller, M.S. (eds.) IWOMP 2014. LNCS, vol. 8766, pp. 1–15. Springer, Heidelberg (2014)

    Google Scholar 

  6. Duran, A., Ayguadé, E., Badia, R., Labarta, J., Martinell, L., Martorell, X., Planas, J.: Ompss: a proposal for programming heterogeneous multi-core architectures. Parallel Process. Lett. 21(02), 173–193 (2011)

    Article  MathSciNet  Google Scholar 

  7. Han, H., Tseng, C.W.: A comparison of parallelization techniques for irregular reductions. In: Proceedings of the 15th International Parallel & Amp; Distributed Processing Symposium, IPDPS 2001, p. 27. IEEE Computer Society, Washington, DC, USA (2001). http://dl.acm.org/citation.cfm?id=645609.662492

  8. Komatitsch, D., Tromp, J.: Introduction to the spectral-element method for 3-D seismic wave propagation 139(3), 806–822 (1999)

    Google Scholar 

  9. OpenMP Architecture Review Board: OpenMP Application Program Interface Version 4.0, July 2013

    Google Scholar 

  10. Yu, H., Dang, F.H., Rauchwerger, L.: Parallel reductions: an application of adaptive algorithm selection. In: Pugh, B., Tseng, C. (eds.) LCPC 2002. LNCS, vol. 2481, pp. 188–202. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Yu, H., Rauchwerger, L.: Adaptive reduction parallelization techniques. In: ACM International Conference on Supercomputing 25th Anniversary Volume, pp. 311–322. ACM, New York, NY, USA (2014). http://doi.acm.org/10.1145/2591635.2667180

Download references

Acknowledgment

This work has been developed with the support of the grant SEV-2011-00067 of Severo Ochoa Program, awarded by the Spanish Government and by the Spanish Ministry of Science and Innovation (contracts TIN2012-34557, and CAC2007-00052) by the Generalitat de Catalunya (contract 2009-SGR-980) and the Intel-BSC Exascale Lab collaboration project.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jan Ciesko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Ciesko, J., Mateo, S., Teruel, X., Martorell, X., Ayguadé, E., Labarta, J. (2016). Supporting Adaptive Privatization Techniques for Irregular Array Reductions in Task-Parallel Programming Models. In: Maruyama, N., de Supinski, B., Wahib, M. (eds) OpenMP: Memory, Devices, and Tasks. IWOMP 2016. Lecture Notes in Computer Science(), vol 9903. Springer, Cham. https://doi.org/10.1007/978-3-319-45550-1_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45550-1_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45549-5

  • Online ISBN: 978-3-319-45550-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics