skip to main content
10.1145/1583991.1584002acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
short-paper

Brief announcement: selfishness in transactional memory

Published: 11 August 2009 Publication History

Abstract

In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI), i.e., writing efficient code for the overall system coincides with writing code that optimizes an individual program's performance. By implementing a selfish strategy, we show that under most contention managers (CM) proposed in the literature so far, TM systems are not GPI compatible, whereas a simple randomized CM is GPI compatible.

References

[1]
H. Attiya, L. Epstein, H. Shachnai, and T. Tamir. Transactional contention management as a non-clairvoyant scheduling problem. In PODC '06: Proc. of the 25th ACM symposium on Principles of Distributed Computing, 308--315, 2006.
[2]
R. Guerraoui, M. Herlihy, and B. Pochon. Toward a theory of transactional contention managers. In PODC '05: Proc. 24th ACM symposium on Principles of Distributed Computing, 258--264, 2005.
[3]
M. Herlihy, V. Luchangco, and M. Moir. A flexible framework for implementing software transactional memory. SIGPLAN Not., 41(10):253--262, 2006.
[4]
M. Herlihy and J. E. B. Moss. Transactional memory: architectural support for lock-free data structures. SIGARCH Comput. Archit. News, 21(2):289--300, 1993.
[5]
W. N. Scherer III and M. L. Scott. Contention Management in Dynamic Software Transactional Memory. In PODC Workshop on Concurrency and Synchronization in Java Programs (CSJP), St. John's, NL, Canada, July 2004.
[6]
W. N. Scherer III and M. L. Scott. Advanced contention management for dynamic software transactional memory. In PODC '05: Proceedings of the 24th annual ACM symposium on Principles of Distributed Computing, pages 240--248, 2005.

Cited By

View all
  • (2009)Good Programming in Transactional MemoryProceedings of the 20th International Symposium on Algorithms and Computation10.1007/978-3-642-10631-6_52(503-513)Online publication date: 5-Dec-2009

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
August 2009
370 pages
ISBN:9781605586069
DOI:10.1145/1583991

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 August 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. contention management
  2. game theory
  3. multicore architecture
  4. transactional memory

Qualifiers

  • Short-paper

Conference

SPAA 09

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25
37th ACM Symposium on Parallelism in Algorithms and Architectures
July 28 - August 1, 2025
Portland , OR , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

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

Other Metrics

Citations

Cited By

View all
  • (2009)Good Programming in Transactional MemoryProceedings of the 20th International Symposium on Algorithms and Computation10.1007/978-3-642-10631-6_52(503-513)Online publication date: 5-Dec-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