Skip to main content
SpringerLink
Log in

Extracting Coarse–Grained Parallelism for Affine Perfectly Nested Quasi–uniform Loops

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7203))

Abstract

This paper presents a new approach for the extraction of coarse–grained parallelism available in program loops. The approach permits for extracting parallelism for both uniform and quasi–uniform perfectly nested parameterized loops, where the loop bounds and data accesses are affine functions of loop indices and symbolic parameters. It extracts a set of synchronization–free code fragments. The procedure has a polynomial time complexity except for one step of calculations. The effectiveness and time complexity of the approach are evaluated by means of loops of the NAS Parallel Benchmark suite.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D’Hollander, E.H.: Partitioning and Labeling of Loops by Unimodular Transformations. IEEE Transactions on Parallel and Distributed Systems 3(4), 465–476 (1992)

    Article  MathSciNet  Google Scholar 

  2. Lim, A.W., Lam, M.S.: Maximizing Parallelism and Minimizing Synchronization with Affine Partitions. Parallel Computing 24(3-4), 445–475 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Griebl, M.: Automatic Parallelization of Loop Programs for Distributed Memory Achitectures. Habilitation. Fakultät für Mathematik und Informatik Universität Passau (2004)

    Google Scholar 

  4. Beletska, A., Bielecki, W., Pietro, P.S.: Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework. In: ISPDC, pp. 203–210 (2007)

    Google Scholar 

  5. Schrijver, A.: Theory of Linear and Integer Programming. Series in Discrete Mathematics (1999)

    Google Scholar 

  6. Nookala, P.K.V.V., Risset, T.: A Library for ℤ–Polyhedral Operations. Publication interne n.1330, Institut de Recherche en Informatique et Systèmes Aléatoires (2000)

    Google Scholar 

  7. Polylib User’s Manual. The Polylib Team (2002)

    Google Scholar 

  8. Höfting, F., Wanke, E.: Polynomial-Time Analysis of Toroidal Periodic Graphs. Journal of Algorithms 34, 14–39 (2000)

    Article  MATH  Google Scholar 

  9. Bondhugula, U.K.R.: Effective Automatic Parallelization and Locality Optimization Using the Polyhedral Model. Dissertation. The Ohio State University (2010)

    Google Scholar 

  10. Quinton, P., Rajopadhye, S., Risset, T.: On Manipulating ℤ–Polyhedra. Publication interne n.1016, Institut de Recherche en Informatique et Systèmes Aléatoires (1996)

    Google Scholar 

  11. Cohen, E., Megiddo, N.: Recognizing Properties of Periodic Graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 4, 135–146 (1991)

    MathSciNet  Google Scholar 

  12. Bastoul, C.: Code Generation in the Polyhedral Model Is Easier Than You Think. In: PACT’13 IEEE International Conference on Parallel Architecture and Compilation Techniques, pp. 7–16 (2004)

    Google Scholar 

  13. NASA Advanced Supercomputing Division, http://www.nas.nasa.gov

  14. https://github.com/davewathaverford/the-omega-project

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, ul.Żołnierska 49, 71-210, Szczecin, Poland

    Włodzimierz Bielecki & Krzysztof Kraska

Authors
  1. Włodzimierz Bielecki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krzysztof Kraska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer and Information Science, Czestochowa University of Technology, Dabrowskiego 69, 42-201, Czestochowa, Poland

    Roman Wyrzykowski  & Konrad Karczewski  & 

  2. Electrical Engineering and Computer Science Department, University of Tennessee, 1122 Volunteer Blvd, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

  3. Department of Informatics and Mathematical Modeling, Technical University of Denmark, Richard Petersens Plads, Building 321, 2800, Kongens Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bielecki, W., Kraska, K. (2012). Extracting Coarse–Grained Parallelism for Affine Perfectly Nested Quasi–uniform Loops. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2011. Lecture Notes in Computer Science, vol 7203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31464-3_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31464-3_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31463-6

  • Online ISBN: 978-3-642-31464-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation