Advertisement

Software Transactional Memory Validation – Time and Space Considerations

  • Adam Welc
  • Bratin Saha
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6760)

Abstract

With single thread performance hitting the power wall, hardware architects have turned to chip-level multiprocessing to increase processor performance. As a result, issues related to the construction of scalable and reliable multi-threaded applications have become increasingly important. One of the most pressing problems in concurrent programming has been synchronizing accesses to shared data among multiple concurrent threads.

Traditionally, accesses to shared memory have been synchronized using lock-based techniques resulting in scalability, composability and safety problems. Recently, transactional memory has been shown to eliminate many problems associated with lock-based synchronization, and transactional constructs have been added to languages to facilitate programming with transactions. Hardware transactional memory (HTM) is at this point readily available only in the simulated environments. Furthermore, some of the TM systems relying on the hardware support are hybrid solutions that require TM operations to be supported in software as well. Therefore, providing an efficient software transactional memory (STM) implementation has been an important area of research. One of the largest overheads in an STM implementation is incurred in the validation procedure (that is, in ensuring correctness of transactional read operations).

This paper presents novel solutions to reduce the validation overhead in an STM. We first present a validation algorithm that is linear in the number of read operations executed by a transaction, and yet does not add any overhead to transactional reads and writes. We then present an algorithm that uses bitmaps to encode information about transactional operations and further reduces both the time and space overheads related to validation. We evaluate the effectiveness of both algorithms in the context of a state-of-the-art STM implementation.

Keywords

Data Item Validation Procedure Transactional Memory Version Number Validation Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adl-Tabatabai, A.-R., Lewis, B.T., Menon, V., Murphy, B.R., Saha, B., Shpeisman, T.: Compiler and runtime support for efficient software transactional memory. In: PLDI 2006 (2006)Google Scholar
  2. 2.
    Ananian, C.S., Asanovic, K., Kuszmaul, B.C., Leiserson, C.E., Lie, S.: Unbounded transactional memory. In: HPCA 2005 (2005)Google Scholar
  3. 3.
    Damron, P., Fedorova, A., Lev, Y., Luchangco, V., Moir, M., Nussbaum, D.: Hybrid transactional memory. In: ASPLOS 2006 (2006)Google Scholar
  4. 4.
    Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. In: Data Management Systems. Morgan Kaufmann, San Francisco (1993)Google Scholar
  5. 5.
    Harris, T., Fraser, K.: Language support for lightweight transactions. In: OOPSLA 2003 (2003)Google Scholar
  6. 6.
    Harris, T., Marlow, S., Peyton-Jones, S., Herlihy, M.: Composable memory transactions. In: PPoPP 2005 (2005)Google Scholar
  7. 7.
    Harris, T., Plesko, M., Shinnar, A., Tarditi, D.: Optimizing memory transactions. In: PLDI 2006 (2006)Google Scholar
  8. 8.
    Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N.: Software transactional memory for dynamic-sized data structures. In: PODC 2003 (2003)Google Scholar
  9. 9.
    Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: ISCA 1993 (1993)Google Scholar
  10. 10.
    Martínez, J.F., Torrellas, J.: Speculative synchronization: Applying thread-level speculation to explicitly parallel applications. In: ASPLOS 2003 (2003)Google Scholar
  11. 11.
    Rajwar, R., Goodman, J.R.: Transactional lock-free execution of lock-based programs. In: ASPLOS 2002 (2002)Google Scholar
  12. 12.
    Rajwar, R., Herlihy, M., Lai, K.: Virtualizing transactional memory. In: ISCA 2005 (2005)Google Scholar
  13. 13.
    Saha, B., Adl-Tabatabai, A.-R., Hudson, R.L., Minh, C.C., Hertzberg, B.: A high performance software transactional memory system for a multi-core runtime. In: PPoPP 2006 (2006)Google Scholar
  14. 14.
    Saha, B., Adl-Tabatabai, A.-R., Jacobson, Q.: Architectural support for software transactional memory. In: MICRO 2006 (2006)Google Scholar
  15. 15.
    Shavit, N., Touitou, D.: Software transactional memory. In: PODC 1995 (1995)Google Scholar
  16. 16.
    Welc, A., Hosking, A.L., Jagannathan, S.: Transparently reconciling transactions with locking for Java synchronization. In: Bateni, M. (ed.) ECOOP 2007. LNCS, vol. 4609. Springer, Heidelberg (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Adam Welc
    • 1
  • Bratin Saha
    • 1
  1. 1.Programming Systems LabIntel CorporationSanta ClaraUSA

Personalised recommendations