Skip to main content

A Combined Technique of Non-uniform Loops

  • Conference paper
Advances in Grid and Pervasive Computing (GPC 2006)

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

Included in the following conference series:

  • 527 Accesses

Abstract

This paper proposes efficient methods such as Improved Tiling Method for non-uniform dependence loops with only flow dependences and Improved Region Partitioning Method for loops with both flow and anti dependences. In the Improved Tiling Method, we propose our incrementing minimum dependence distance technique and loop interchanging technique. In Improved Region Partitioning Method, we eliminate anti dependences from the nested loop by variable renaming. After variable renaming, this method can divide the iteration space into two parallel regions as large as possible and one or less serial region as small as possible. By combination of existing methods and our proposed methods, it exposes more parallelism.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Lilja, D.J.: Exploiting the parallelism available in loop. IEEE Computer, 13–26 (1994)

    Google Scholar 

  2. Tzen, T., Ni, L.: Dependence uniformization: A loop parallelization technique. IEEE Trans. Parallel and Distributed Systems 4(5), 547–558 (1993)

    Article  Google Scholar 

  3. Punyamurtula, S., Chaudhary, V.: Minimum dependence distance tiling of nested loops with non-uniform dependences. In: Proc. Symp. Parallel and Distributed Processing, pp. 74–81 (1994)

    Google Scholar 

  4. Ju, J., Chaudhary, V.: Unique sets oriented Partitioning of nested loops with non-uniform dependences. In: Proc. Int. Conf. Parallel Processing, vol. III, pp. 45–52 (1996)

    Google Scholar 

  5. Zaafrani, A., Ito, M.R.: Parallel region execution of loops with irregular dependencies. In: Proc. Int. Conf. Parallel Processing, vol. II, pp. 11–19 (1994)

    Google Scholar 

  6. Cho, C.K., Lee, M.H.: A Loop Parallization Method for Nested Loops with Non-uniform Dependences. In: Proceedings of the International Conference on Parallel and Distributed Systems, pp. 314–321 (1997)

    Google Scholar 

  7. Jeong, S.J.: Maximizing Parallelism for Nested Loops with Non-uniform Dependences. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3046, pp. 213–222. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Pean, D.-L., Chen, C.: CDCHP: a new effective mechanism to maximize parallelism of nested loops with non-uniform dependences. The Journal of Systems and Software 56, 279–297 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jeong, S.J., Han, K.H., Park, Y.C. (2006). A Combined Technique of Non-uniform Loops. In: Chung, YC., Moreira, J.E. (eds) Advances in Grid and Pervasive Computing. GPC 2006. Lecture Notes in Computer Science, vol 3947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11745693_20

Download citation

  • DOI: https://doi.org/10.1007/11745693_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33809-3

  • Online ISBN: 978-3-540-33810-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics