Skip to main content
SpringerLink
Log in

SME: A New Software Transactional Memory Based Mutual Exclusion Algorithm for Distributed Systems

  • Conference paper
  • First Online:
Computer Information Systems and Industrial Management (CISIM 2018)

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

  • 1160 Accesses

Abstract

The utilization of concurrent computing has significantly increased in the last three decades for various commercial and scientific applications. However, concurrent systems often have an astronomically large number of possible executions. These executions may proceed in many different ways depending on scheduling of processes, sequence of inputs, etc. Such non-determinism often leads to gaps or malfunctions in the system design. Thus synchronization of resources became a great issue and programmers had to put huge effort solving this. Transactional memory is one of those measures to solve these inconsistencies. The goal of a transactional memory system is to transparently support the definition of regions of code that are considered in a transaction to maintain the ACID properties of transactions. This paper explores the possibility of designing a STM based mutual exclusion algorithm and compares its performance in terms of time and message complexity. A new STM-based mutual exclusion algorithm known as SME has been proposed and the results have been compared with those due to traditional FAPP algorithm. Besides, the proposed SME implementation is on the ring topology that provides a stable structure suitable for increasing the degree of multiprogramming.

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. Kanrar, S., Chaki, N.: FAPP: a new fairness algorithm for priority process mutual exclusion in distributed systems. Spec. Issue Recent. Adv. Netw. Parallel Comput. Int. J. Netw. 5(1), 11–18 (2010)

    Google Scholar 

  2. Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7, 61–77 (1989)

    Article  Google Scholar 

  3. Kanrar, S., Chaki, N.: Modified Raymond’s algorithm for priority (MRA-P) based mutual exclusion in distributed systems. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds.) ICDCIT 2006. LNCS, vol. 4317, pp. 325–332. Springer, Heidelberg (2006). https://doi.org/10.1007/11951957_29

    Chapter  Google Scholar 

  4. Harris, T., Fraser, K.: Language support for lightweight transactions. In: 18th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOP-SLA 2003, pp. 388–402 (2003)

    Google Scholar 

  5. Shavit, N., Touitou, D.: Software transactional memory. In: 14th ACM Symposium on Principles of Distributed Computing. PODC 1995, pp. 204–213 (1995)

    Google Scholar 

  6. Naik, M., Aiken, A., Whaley, J.: Effective static race detection for Java. In: PLDI 2006: Proceeding of 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 308–319(2006)

    Google Scholar 

  7. Abadi, M., Birrell, A., Harris, T., Isard, M.: Semantics of transactional memory and automatic mutual exclusion. In: Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, vol. 20, pp. 1–49 (2008)

    Google Scholar 

  8. Harris, T., Plesko, M., Shinnar, A., Tarditi, D.: Optimizing memory transactions. In: ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI 2006, pp. 14–25 (2006)

    Google Scholar 

  9. Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. In: 20th Annual International Symposium on Computer Architecture, pp. 289–300 (1993)

    Google Scholar 

  10. Attiya, H.: Needed: foundations for transactional memory. Newsl. ACM SIGACT News Arch. 39(1), 59–61 (2008)

    Article  Google Scholar 

  11. Shpeisman, T., et al.: Enforcing isolation and ordering in STM. In: PLDI 2007: Proceedings of 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 78–88 (2007)

    Google Scholar 

  12. Charles, P., et al.: X10: an object-oriented approach to non-uniform cluster computing. In: OOPSLA 2005: Object-Oriented Programing, Systems, Languages, and Applications (2005)

    Google Scholar 

  13. Herlihy, M., Luchangcogton, V., Moir, M.N., Scherer III, W.: Software transactional memory for dynamic-sized data structure. In: 22nd Annual Symposium on Principles of Distributed Computing, PODC 2003, pp. 13–16. ACM, USA (2003)

    Google Scholar 

  14. Herlihy, M., Linearizability, J.W.: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463–492 (1990)

    Article  Google Scholar 

  15. Afekn, Y., Dauber, D., Touitou, D.: Wait-free made fast. In: 27th Annual ACM Symposium on Theory of Computing, pp. 538–547 (1995)

    Google Scholar 

  16. Shavit, N., Touitou, D.: Software transactional memory. Distrib. Comput. Spec. Issue 10, 99–116 (1997)

    Article  Google Scholar 

  17. Banerjee, S., Mukherjee, P., Kanrar, S., Chaki, N.: A novel symmetric algorithm for process synchronization in distributed systems. In: Conference on Algorithms and application (ALAP 2018), pp. 69–82 (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Narasinha Dutt College, Howrah, India

    Sukhendu Kanrar

Authors
  1. Sukhendu Kanrar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sukhendu Kanrar .

Editor information

Editors and Affiliations

  1. Bialystok University of Technology, Bialystok, Poland

    Khalid Saeed

  2. Warsaw University of Technology, Warsaw, Poland

    Władysław Homenda

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kanrar, S. (2018). SME: A New Software Transactional Memory Based Mutual Exclusion Algorithm for Distributed Systems. In: Saeed, K., Homenda, W. (eds) Computer Information Systems and Industrial Management. CISIM 2018. Lecture Notes in Computer Science(), vol 11127. Springer, Cham. https://doi.org/10.1007/978-3-319-99954-8_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99954-8_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99953-1

  • Online ISBN: 978-3-319-99954-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation