Abstract
In this paper, we propose a new technique that can identify transaction-local memory (i.e. captured memory), in managed environments, while having a low runtime overhead. We implemented our proposal in a well known STM framework (Deuce) and we tested it in STMBench7 with two different STMs: TL2 and LSA. In both STMs the performance improved significantly (4 times and 2.6 times, respectively). Moreover, running the STAMP benchmarks with our approach shows improvements of 7 times in the best case for the Vacation application.
- Y. Afek, G. Korland, and A. Zilberstein, Lowering STM overhead with static analysis, LCPC'10, Springer-Verlag, 2011, pp. 31--45. Google Scholar
Digital Library
- D. Dice, O. Shalev, and N. Shavit, Transactional locking II, DISC'06, Springer-Verlag, 2006, pp. 194--208. Google Scholar
Digital Library
- A. Dragojevic, Y. Ni, and A. Adl-Tabatabai, Optimizing transactions for captured memory, SPAA '09, ACM, 2009, pp. 214--222. Google Scholar
Digital Library
- R. Guerraoui, M. Kapalka, and J. Vitek, STMBench7: a benchmark for software transactional memory, EuroSys '07, ACM, 2007, pp. 315--324. Google Scholar
Digital Library
- G. Korland, N. Shavit, and P. Felber, Noninvasive concurrency with java STM, MultiProg 2010, 2010.Google Scholar
- C. Minh, J. Chung, C. Kozyrakis, and K. Olukotun, STAMP: Stanford transactional applications for multi-processing, Workload Characterization, 2008. IISWC 2008. IEEE International Symposium on, sept. 2008, pp. 35--46.Google Scholar
Cross Ref
- T. Riegel, P. Felber, and C. Fetzer, A lazy snapshot algorithm with eager validation, DISC'06, Springer-Verlag, 2006, pp. 284--298. Google Scholar
Digital Library
- R. Yoo, Y. Ni, A.Welc, B. Saha, A. Adl-Tabatabai, and H. Lee, Kicking the tires of software transactional memory: why the going gets tough, SPAA '08, ACM, 2008, pp. 265--274. Google Scholar
Digital Library
Index Terms
Runtime elision of transactional barriers for captured memory
Recommendations
Runtime elision of transactional barriers for captured memory
PPoPP '13: Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programmingIn this paper, we propose a new technique that can identify transaction-local memory (i.e. captured memory), in managed environments, while having a low runtime overhead. We implemented our proposal in a well known STM framework (Deuce) and we tested it ...
Lightweight Identification of Captured Memory for Software Transactional Memory
ICA3PP 2013: Proceedings of the 13th International Conference on Algorithms and Architectures for Parallel Processing - Volume 8285Software Transactional Memory (STM) implementations typically instrument each memory access within transactions with a call to an STM barrier to ensure the correctness of the transactions. Compared to simple memory accesses, STM barriers are complex ...
Optimizing transactions for captured memory
SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architecturesIn this paper, we identify transaction-local memory as a major source of overhead from compiler instrumentation in software transactional memory (STM). Transaction-local memory is memory allocated inside a transaction, which cannot escape (i.e., is ...







Comments