skip to main content
poster

Runtime elision of transactional barriers for captured memory

Published:23 February 2013Publication History
Skip Abstract Section

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.

References

  1. Y. Afek, G. Korland, and A. Zilberstein, Lowering STM overhead with static analysis, LCPC'10, Springer-Verlag, 2011, pp. 31--45. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. Dice, O. Shalev, and N. Shavit, Transactional locking II, DISC'06, Springer-Verlag, 2006, pp. 194--208. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Dragojevic, Y. Ni, and A. Adl-Tabatabai, Optimizing transactions for captured memory, SPAA '09, ACM, 2009, pp. 214--222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Guerraoui, M. Kapalka, and J. Vitek, STMBench7: a benchmark for software transactional memory, EuroSys '07, ACM, 2007, pp. 315--324. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. G. Korland, N. Shavit, and P. Felber, Noninvasive concurrency with java STM, MultiProg 2010, 2010.Google ScholarGoogle Scholar
  6. 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 ScholarGoogle ScholarCross RefCross Ref
  7. T. Riegel, P. Felber, and C. Fetzer, A lazy snapshot algorithm with eager validation, DISC'06, Springer-Verlag, 2006, pp. 284--298. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Runtime elision of transactional barriers for captured memory

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM SIGPLAN Notices
        ACM SIGPLAN Notices  Volume 48, Issue 8
        PPoPP '13
        August 2013
        309 pages
        ISSN:0362-1340
        EISSN:1558-1160
        DOI:10.1145/2517327
        Issue’s Table of Contents
        • cover image ACM Conferences
          PPoPP '13: Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
          February 2013
          332 pages
          ISBN:9781450319225
          DOI:10.1145/2442516

        Copyright © 2013 Authors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 23 February 2013

        Check for updates

        Qualifiers

        • poster

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!