Skip to main content
SpringerLink
Log in

Effective OpenMP Extensions for Irregular Applications on Cluster Environments

  • Conference paper
Grid and Cooperative Computing (GCC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3033))

Included in the following conference series:

Abstract

Sparse and unstructured computations are widely used in Scientific and Engineering Applications. Such problem inherent in sparse and unstructured computations is called irregular problem. In this paper, we propose some extensions to OpenMP directives, aiming at efficient irregular OpenMP codes to be executed in parallel. These OpenMP directives include scheduling for irregular loops, inspector/executor for parallelizing irregular reduction, and eliminating ordered loops. We also introduce implementation strategies with respect to these extensions.

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 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. Asenjo, R., Gutierrez, E., Lin, Y., Padua, D., Pottengerg, B., Zapata, E.L.: On the Automatic Parallelization of Sparse and irregular Fortran codes. Technical Report 1512, University of Illinois at Urbana-Champaign, CSRD (December 1996)

    Google Scholar 

  2. Blume, W., Eigenmann, R.: Nonlinear and symbolic data dependence testing. IEEE Transactions on Parallel and Distributed Systems 9(12), 1180–1194 (1998)

    Article  Google Scholar 

  3. Guo, M., Pan, Y., Liu, C.: Symbolic Communication Set generation for irregular parallel applications. The Journal of Supercomputing 25(3), 197–214 (2003)

    Article  Google Scholar 

  4. Guo, M.: Efficient Loop Partitioning for parallel codes of irregular Scientific Computations. IEICE Transactions on Information and Systems E86-D(9), 442–451 (2003)

    Google Scholar 

  5. Gutierrez, E., Asenjo, R., Plata, O., Zapata, E.L.: Automatic parallelization of irregular applications. Parallel Computing 26, 1709–1738 (2000)

    Article  MATH  Google Scholar 

  6. Hu, Y., Cox, A., Zwaenepoel, W.: Improving fine-grained irregular sharedmemory benchmarks by data reordering. In: Proceedings of SC 2000, Dallas, TX (November 2000)

    Google Scholar 

  7. Nikolopoulos, D.S., Papatheodorou, T.S., Polychronopoulos, C.D., Labarta, J., Ayguade, E.: Data Distribution Necessary in OpenMP? In: Proceedings of SC (2000)

    Google Scholar 

  8. Ponnusamy, R., Saltz, J., Choudhary, A., Hwang, S., Fox, G.: Runtime support and compilation methods for user-specified data distributions. IEEE Transactions on Parallel and Distributed Systems 6(8), 815–831 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Software, The University of Aizu, Aizu-Wakamatsu City, Fukushima, 965-8580, Japan

    Minyi Guo & Li Li

  2. Department of Computing, The Hong Kong Polytechnic University, Kowloon, Hong Kong

    Jiannong Cao

  3. Department of Information Management, Southern Taiwan University of Technology, Tainan County, Taiwan

    Weng-Long Chang

  4. School of Computer and Information Science, University of South Australia, Mawson Lakes, South Australia, 5095, Australia

    Chengfei Liu

Authors
  1. Minyi Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiannong Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weng-Long Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Li Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Chengfei Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiatong University, 80 Dongcuan Road, 200240, Shanghai, China

    Minglu Li

  2. Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA

    Xian-He Sun

  3. Department. of Computer Science, Shanghai Jiaotong University, 1954 HuaShan Road, 200030, Shanghai, P.R. China

    Qianni Deng

  4. Department of Computer Science, College of Liberal Arts and Science, University of Iowa, IA 52242, Iowa City, USA

    Jun Ni

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guo, M., Cao, J., Chang, WL., Li, L., Liu, C. (2004). Effective OpenMP Extensions for Irregular Applications on Cluster Environments. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24680-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21993-4

  • Online ISBN: 978-3-540-24680-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation