Skip to main content
SpringerLink
Log in

A Lightweight Implementation of Obstruction-Free Software Transactional Memory

  • Chapter
  • First Online:
Applied Computation and Security Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 305))

Abstract

Software transactional memory (STM) has evolved as an alternative for traditional lock-based process synchronization. It promises greater degree of concurrency and faster execution. This paper proposes a simple, lightweight, and yet efficient implementation of OFTM. The major contribution of the paper is in proposing a new STM algorithm that uses simple data structure. This does not require any contention manager toward ensuring progress condition, atomicity, and serializability of transactions besides maintaining data consistency. Experimental simulation on random data set establishes the merit of the proposed solution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lockfree data structures. In: Proceedings of 20th Annual International Symposium on Computer Architecture, ISCA ’93, pp. 289–300, May 1993

    Google Scholar 

  2. Shavit, N., Touitou, D.: Software transactional memory. In: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 204–213. ACM August 1995

    Google Scholar 

  3. Marathe, V.J., Scott, M.L.: A Qualitative Survey of Modern Software Transactional Memory Systems. Technical Report Nr. TR 839. University of Rochester, Computer Science Department (2004)

    Google Scholar 

  4. Herlihy, M.: Wait-free synchronization. TOPLAS: ACM Trans. Program. Lang. Syst. 13(1), 124–149 (1997)

    Article  Google Scholar 

  5. Fraser, K.: Practical lock freedom. PhD Dissertation, Cambridge University Computer Laboratory (2003)

    Google Scholar 

  6. Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: double-ended queues as an example. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 522–529 (2003)

    Google Scholar 

  7. Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N.: Software transactional memory for dynamic-sized data structures. In: 22nd Annual ACM Symposium on Principles of Distributed Computing, pp. 92–101, July 2003

    Google Scholar 

  8. Scherer III, W.N., Scott, M.L.: Advanced contention management for dynamic software transactional memory. In: 24th Annual ACM Symposium on Principles of Distributed Computing, PODC ’05, pp. 240–248 (2005)

    Google Scholar 

  9. Maranthe, V.J., Scherer III, W.N., Scott, M.L.: Adaptive software transactional memory. In: Proceedings of the 19th International Symposium on Distributed Computing (DISC), pp. 354–368, May 2005

    Google Scholar 

  10. Tabba, F., Wang, C., Goodman, J.R., Moir, M.: NZTM: non-blocking zero-indirection transactional memory. In: Proceedings of the 21st ACM Annual Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 204–213 (2009)

    Google Scholar 

  11. Ghosh, A., Chaki, N.: Design of a new OFTM algorithm towards abort-free execution. In: 9th International Conference, ICDCIT 2013, pp. 255–266, Bhubaneswar, India, 5–8 Feb 2013

    Google Scholar 

  12. Harris, T., Larus, J., Rajwar, R.: Transactional Memory, 2nd edn., pp. 101–145. Morgan & Claypool, (2010)

    Google Scholar 

  13. Perelman, D., Fan, R., Keidar, I.: On maintaining multiple versions in STM. In: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC ’10, pp. 16–25 (2010)

    Google Scholar 

  14. Attiya, H., Hillel, E.: Single-version STMs can be multi-version permissive. In: Proceedings of the 12th International Conference on Distributed Computing and Networking, ICDCN’11, pp. 83–94, Bangalore, India (2011)

    Google Scholar 

  15. http://www.eg.bucknell.edu/~xmeng/Course/CS6337/Note/master/node40.html (2014)

  16. Knuth, D.E.: The art of computer programming. Seminumerical Algorithms, vol. 2, 3rd edn. Addison-Wesley, Reading (1997). ISBN 0-201-89684-2

    Google Scholar 

  17. Guerraoui, R., Kapałka, M.: On obstruction-free transactions. In: Proceedings of the 29th Annual Symposium on Parallelism in Algorithms and Architectures, pp. 304–313 (2008)

    Google Scholar 

  18. Guerraoui, R., Kapalka, M.: The semantics of progress in lock-based transactional memory. In: POPL ’09, pp. 404–415 (2009)

    Google Scholar 

  19. Guerraoui, R., Henzinger, T.A., Singh, V.: Permissiveness in transactional memories: In: Proceedings of the 22nd International Symposium on Distributed Computing (2008)

    Google Scholar 

  20. Crain, T., Imbs, D., Raynal, M.: Read invisibility, virtual world consistency and probabilistic permissiveness are compatible. In: Algorithms and Architectures for Parallel Processing, pp. 244–257. Springer, Berlin (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Calcutta, Kolkata, India

    Ankita Saha, Atrayee Chatterjee, Nabanita Pal, Ammlan Ghosh & Nabendu Chaki

Authors
  1. Ankita Saha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Atrayee Chatterjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nabanita Pal
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ammlan Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Nabendu Chaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nabendu Chaki .

Editor information

Editors and Affiliations

  1. A.K. Choudhury School of Information Technology, University of Calcutta, Kolkata, West Bengal, India

    Rituparna Chaki

  2. Faculty of Physics and Applied Computer Science, AGH University of Science and Technology, Cracow, Poland

    Khalid Saeed

  3. Department of Computer Science and Engineering, University of Calcutta, Kolkata, West Bengal, India

    Sankhayan Choudhury

  4. Department of Computer Science and Engineering, University of Calcutta, Kolkata, India

    Nabendu Chaki

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer India

About this chapter

Cite this chapter

Saha, A., Chatterjee, A., Pal, N., Ghosh, A., Chaki, N. (2015). A Lightweight Implementation of Obstruction-Free Software Transactional Memory. In: Chaki, R., Saeed, K., Choudhury, S., Chaki, N. (eds) Applied Computation and Security Systems. Advances in Intelligent Systems and Computing, vol 305. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1988-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1988-0_5

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1987-3

  • Online ISBN: 978-81-322-1988-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation