ACM Home Page
Please provide us with feedback. Feedback
Brief announcement: selfishness in transactional memory
Full text PdfPdf (503 KB)
Source
ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures table of contents
Calgary, AB, Canada
SESSION: Brief Announcements I table of contents
Pages 41-42  
Year of Publication: 2009
ISBN:978-1-60558-606-9
Authors
Raphael P. Eidenbenz  ETH Zurich, Zurich, Switzerland
Roger Wattenhofer  ETH Zurich, Zurich, Switzerland
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 40,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1583991.1584002
What is a DOI?

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

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
2
3
4
5
6

Collaborative Colleagues:
Raphael P. Eidenbenz: colleagues
Roger Wattenhofer: colleagues