Parallel programming with transactional memory

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Parallel programming with transactional memory

Full text

Digital Edition , Html

Html (4 KB), Pdf

Pdf (3.37 MB)

Source

Communications of the ACM archive
Volume 52 , Issue 2 (February 2009) table of contents
Inspiring Women in Computing

COLUMN: Practice table of contents

Pages: 38-43

Year of Publication: 2009

ISSN:0001-0782

Author

Ulrich Drepper

Red Hat

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 147, Downloads (12 Months): 1416, 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/1461928.1461943 What is a DOI?

Warning: The download time has expired please click on the item to try again.

ABSTRACT

While still primarily a research project, transactional memory shows promise for making parallel programming easier.

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	Drepper, U. What every programmer should know about memory (2007); http://people.redhat.com/drepper/cpumemory.pdf.
	2	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