Skip to main content

Abstract

While multithreaded programming is an effective way to exploit concurrency, multithreaded programs are notoriously hard to program, debug and tune for performance. In this chapter, we present OpenMP shared memory programming as a viable alternative and a much simpler way to write multithreaded programs. We show through empirical results obtained by running, on a single processor machine, a simple matrix multiplication program written in OpenMP C that the drop in performance compared with the single threaded version even on a uniprocessor machine may be negligible. However, this is well compensated for by the increased programmer productivity resulting from the ease of programming, debugging, tuning and the relative ease of OpenMP skill acquisition.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. S.G. Akl, Parallel Computation: Models and Methods (Prentice-Hall, Englewood Cliffs, New Jersey, 1997 ).

    Google Scholar 

  2. J. M. Bull and M. E. Kambites, JOMP - an OpenMP-like Interface for Java, Edinburgh Parallel Computing Center, UK, 1999.

    Google Scholar 

  3. C. Brunschen, “OdinMP/CCp - A Portable Compiler for C with OpenMP to C with POSIX Threads”, MSc Thesis, Dept of Info. Tech., Lund University, Sweden, 1999.

    Google Scholar 

  4. H. Lu, Y C Hu and W Zwaenepoel, OpenMP on Networks of Computers, in Proc. Super-computing ‘88: High Performance Networking and Computing, November 1998.

    Google Scholar 

  5. G. Narlikar and G. Blelloch, Pthreads for Dynamic and Irregular Parallelism, in Proc. Supercomputing ‘88: High Performance Networking and Computing, November 1998.

    Google Scholar 

  6. The OpenMP ARB, “OpenMP: A Proposed Industry Standard SPI for Shared Memory Programming”, Oct. 1997. paper.html.

    Google Scholar 

  7. The OpenMP ARB, “OpenMP C and C++ Application Program Interface”, Oct. 1998.

    Google Scholar 

  8. J. K. Ousterhout, Why threads are a bad idea (for most purposes). Invited talk at the 1996 USENIX Conference, 1996.

    Google Scholar 

  9. K. V. Rao, Open MP Tutorial, A presentation given at Alliance 98, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media New York

About this chapter

Cite this chapter

Rufai, R.A., Bozyigit, M., AlGhamdi, J.S., Ahmed, M. (2004). Multithreaded Parallelism with OpenMP. In: Yang, L.T., Pan, Y. (eds) High Performance Scientific and Engineering Computing. The Springer International Series in Engineering and Computer Science, vol 750. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5402-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-5402-5_1

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5389-6

  • Online ISBN: 978-1-4757-5402-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics