Can Transactions Enhance Parallel Programs?

Transactional programming constructs have been proposed as key elements of advanced parallel programming models. Currently, it is not well understood to what extent such constructs enable efficient parallel program implementations and ease parallel programming beyond what is possible with existing t...

Full description

Saved in:
Bibliographic Details
Published inLanguages and Compilers for Parallel Computing Vol. 4382; pp. 2 - 16
Main Authors Johnson, Troy A., Lee, Sang-Ik, Min, Seung-Jai, Eigenmann, Rudolf
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2007
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Transactional programming constructs have been proposed as key elements of advanced parallel programming models. Currently, it is not well understood to what extent such constructs enable efficient parallel program implementations and ease parallel programming beyond what is possible with existing techniques. To help answer these questions, we investigate the technology underlying transactions and compare it to existing parallelization techniques. We also consider the most important parallelizing transformation techniques and look for opportunities to further improve them through transactional constructs or – vice versa – to improve transactions with these transformations. Finally, we evaluate the use of transactions in the SPEC OMP benchmarks.
Bibliography:This work is supported in part by the National Science Foundation under Grants No. 0103582-EIA, and 0429535-CCF.
ISBN:9783540725206
3540725202
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-72521-3_2