6 search results - page 1 / 2 » On avoiding spare aborts in transactional memory |
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, co...
PODC
2010
ACM
13 years 7 months ago
2010
ACM
We present a single-version STM that satisfies a practical notion of permissiveness: it never aborts read-only transactions, and it only aborts an update transaction due to anothe...
PPL
2010
13 years 3 months ago
2010
We present the Input Acceptance of Transactional Memory (TM). Despite the large interest for performance of TMs, no existing research work has investigated the impact of solving a...
PPOPP
2009
ACM
14 years 5 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
PPOPP
2006
ACM
13 years 11 months ago
2006
ACM
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...