Software Transactional Memory, OpenMP and Pthread implementations of the Conjugate Gradients Method - a Preliminary Evaluation

  • Sven Janko (Author)
  • Björn Rocker (Author)
  • Martin Schindewolf (Author)
  • Vincent Heuveline (Author)
    Engineering Mathematics and Computing Lab (EMCL), Interdisciplinary Center for Scientific Computing (IWR), Heidelberg University
  • Wolfgang Karl (Author)

Identifiers (Article)

DOI: https://doi.org/10.11588/emclpp.2012.01.11700

Identifiers (Files)

URN: http://nbn-resolving.de/urn:nbn:de:bsz:16-emclpp-117006 (PDF)

Abstract

This paper shows the runtime and cache-efficiency of parallel implementations of the Conjugate Gradients Method based on the three paradigms Software Transactional Memory (STM), OpenMP and Pthreads. While the two last named concepts are used to manage parallelization as well as synchronization, STM was designed to handle only the latter. In our work we disclose that an improved cache efficiency does not necessarily lead to a better execution time because the execution time is dominated by the thread wait time at the barriers.

Statistics

loading

References

The Engineering Mathematics and Computing Lab (EMCL), directed by Prof. Dr. Vincent Heuveline, is a research group at the Interdisciplinary Center for Scientific Computing (IWR).

The EMCL Preprint Series contains publications that were accepted for the Preprint Series of the EMCL and are planned to be published in journals, books, etc. soon.

The EMCL Preprint Series was published under the roof of the Karlsruhe Institute of Technology (KIT) until April 30, 2013. As from May 01, 2013 it is published under the roof of Heidelberg University.

Published
2012-07-01
Issue
No. 01 (2012): Software Transactional Memory, OpenMP and Pthread implementations of the CG Method - A Preliminary Evaluation
Section
Artikel
Language
en