skip to main content
10.1145/1400751.1400850acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
demonstration

Transactional memory retry mechanisms

Published: 18 August 2008 Publication History

Abstract

No abstract available.

References

[1]
P. Damron, A. Fedorova, Y. Lev, V. Luchangco, M. Moir, and D. Nussbaum. Hybrid Transactional Memory. 12th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems, San Jose, CA, Oct. 2006.
[2]
T. Harris, S. Marlow, S. Peyton Jones, and M. Herlihy. Composable Memory Transactions. 10th ACM SIGPLAN 2006 Symp. on Principles and Practice of Parallel Programming, pages 48--60, Chicago, IL, June 2005.
[3]
M. F. Spear, V. J. Marathe, W. N. Scherer III, and M. L. Scott. Conflict Detection and Validation Strategies for Software Transactional Memory. 20th Intl. Symp. on Distributed Computing, Stockholm, Sweden, Sept. 2006.
[4]
M. F. Spear, A. Sveikauskas, and M. L. Scott. Transactional Memory Retry Mechanisms. TR 935, Dept. of Computer Science, Univ. of Rochester, June 2008.
[5]
Univ. of Rochester. Rochester Software Transactional Memory. http://www.cs.rochester.edu/research/synchronization/rstm/.

Cited By

View all
  • (2009)A comprehensive strategy for contention management in software transactional memoryACM SIGPLAN Notices10.1145/1594835.150419944:4(141-150)Online publication date: 14-Feb-2009
  • (2009)A comprehensive strategy for contention management in software transactional memoryProceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/1504176.1504199(141-150)Online publication date: 14-Feb-2009

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
August 2008
474 pages
ISBN:9781595939890
DOI:10.1145/1400751
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 August 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. bloom filters
  2. condition synchronization
  3. transactional memory

Qualifiers

  • Demonstration

Conference

PODC '08

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 07 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2009)A comprehensive strategy for contention management in software transactional memoryACM SIGPLAN Notices10.1145/1594835.150419944:4(141-150)Online publication date: 14-Feb-2009
  • (2009)A comprehensive strategy for contention management in software transactional memoryProceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/1504176.1504199(141-150)Online publication date: 14-Feb-2009

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media