Parallel Programming with Transactional Memory

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parallel Programming with Transactional Memory

Full text

Digital Edition , Html

Html (27 KB), Pdf

Pdf (291 KB)

Source

Queue archive
Volume 6 , Issue 5 (September 2008) table of contents
The Concurrency Problem

FEATURE: Q focus: Concurrency table of contents

Pages 38-45

Year of Publication: 2008

ISSN:1542-7730

Author

Ulrich Drepper

Red Hat

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 282, Downloads (12 Months): 1247, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1454456.1454464 What is a DOI?

ABSTRACT

While sometimes even writing regular, single-threaded programs can be quite challenging, trying to split a program into multiple pieces that can be executed in parallel adds a whole dimension of additional problems. Drawing upon the transaction concept familiar to most programmers, transactional memory was designed to solve some of these problems and make parallel programming easier. Ulrich Drepper from Red Hat shows us how it's done.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Maurice Herlihy , J. Eliot B. Moss, Transactional memory: architectural support for lock-free data structures, Proceedings of the 20th annual international symposium on Computer architecture, p.289-300, May 16-19, 1993, San Diego, California, United States
	2	Drepper, U. 2007. What every programmer should know about memory; http://people.redhat.com/drepper/cpumemory.pdf.