Skip to main content

TMBean: Optimistic Concurrency in Application Servers Using Transactional Memory

  • Conference paper
On the Move to Meaningful Internet Systems: OTM 2009 (OTM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5870))

  • 745 Accesses

Abstract

In this experience report, we present an evaluation of different techniques to manage concurrency in the context of application servers. Traditionally, using entity beans is considered as the only way to synchronize concurrent access to data in Jave EE and using mechanism such as synchronized blocks within EJBs is strongly not recommended. In our evaluation we consider the use of software transactional memory to enable concurrent accesses to shared data across different session beans. We are also comparing our approach with using (1) entity beans and (2) session beans synchronized by a global lock.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adl-Tabatabai, A.-R., Kozyrakis, C., Saha, B.: Unlocking concurrency. Queue 4(10), 24–33 (2007)

    Article  Google Scholar 

  2. Cachopo, J., Rito-Silva, A.: Versioned boxes as the basis for memory transactions. In: Proceedings of SCOOL (2005)

    Google Scholar 

  3. Dice, D., Shalev, O., Shavit, N.: Transactional Locking II. In: Proceedings of DISC (September 2006)

    Google Scholar 

  4. Felber, P., Riegel, T., Fetzer, C.: Dynamic performance tuning of word-based software transactional memory. In: Proceedings of PPoPP (February 2008)

    Google Scholar 

  5. Guerraoui, R., Herlihy, M., Pochon, S.: Toward a theory of transactional contention managers. In: Proceedings of PODC (July 2005)

    Google Scholar 

  6. Harris, T., Fraser, K.: Language support for lightweight transactions. In: Proceedings of OOPSLA (October 2003)

    Google Scholar 

  7. Harris, T., Herlihy, M., Marlow, S., Peyton-Jones, S.: Composable memory transactions. In: Proceedings of PPoPP (June 2005)

    Google Scholar 

  8. Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N.: Software transactional memory for dynamic-sized data structures. In: Proceedings of PODC (July 2003)

    Google Scholar 

  9. Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: Proceedings of ISCA (1993)

    Google Scholar 

  10. Scherer III, W.N., Scott, M.L.: Advanced contention management for dynamic software transactional memory. In: Proceedings of PODC (July 2005)

    Google Scholar 

  11. Larus, J., Kozyrakis, C.: Transactional memory. Communication of the ACM 51(7), 80–88 (2008)

    Article  Google Scholar 

  12. Marathe, V.J., Scherer III, W.N., Scott, M.L.: Adaptive software transactional memory. In: Proceedings of DISC (2005)

    Google Scholar 

  13. Riegel, T., Felber, P., Fetzer, C.: A lazy snapshot algorithm with eager validation. In: Proceedings of DISC (September 2006)

    Google Scholar 

  14. Riegel, T., Fetzer, C., Felber, P.: Time-based transactional memory with scalable time bases. In: Proceedings of SPAA (June 2007)

    Google Scholar 

  15. Saha, B., Adl-Tabatabai, A.-R., Hudson, R.L., Minh, C.C., Hertzberg, B.: McRT-STM: a high performance software transactional memory system for a multi-core runtime. In: Proceedings of PPoPP (2006)

    Google Scholar 

  16. Shavit, N., Touitou, D.: Software transactional memory. Distributed Computing 10(2), 99–116 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Charles, L., Felber, P., Gête, C. (2009). TMBean: Optimistic Concurrency in Application Servers Using Transactional Memory. In: Meersman, R., Dillon, T., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2009. OTM 2009. Lecture Notes in Computer Science, vol 5870. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05148-7_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-05148-7_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05147-0

  • Online ISBN: 978-3-642-05148-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics