Skip to main content

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 116))

  • 456 Accesses

Abstract

In token-based approach of algorithms to solve distributed ME problems

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and 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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Lin, T., Moh, S., Moh, M.: Brief announcement: improved asynchronous group mutual exclusion in token passing networks. In: Proceedings of PODC’05, pp. 275–275 (2005)

    Google Scholar 

  2. Zarafshan, F., Karimi, A., Al-Haddad, S.A.R., Saripan, M.I., Subramaniam, S.: A preliminary study on ancestral voting algorithm for availability improvement of mutual exclusion in partitioned distributed systems. In: Proceedings of International Conference on Computers and Computing (ICCC’11), pp. 61–69 (2011)

    Google Scholar 

  3. Saxena, P.C., Rai, J.: A survey of permission-based distributed mutual exclusion algorithms. Comput. Stan. Interfaces 25(2), 159–181 (2003)

    Article  Google Scholar 

  4. Helary, J.M., Mostefaoui, A., Raynal, M.: A general scheme for token and tree based distributed mutual exclusion algorithm. IEEE Trans. Parallel. Distrib. Syst. 5(11), 1185–1196 (1994)

    Article  Google Scholar 

  5. Naimi, M., Trehel, M., Arnold, A.: A log(N) distributed mutual exclusion algorithm based on path reversal. J. Parallel. Distrib. Comput. 34(1), 1–13 (1996)

    Article  Google Scholar 

  6. Sanders, B.: The information structure of distributed mutual exclusion algorithm. ACM Comput. Syst. 5(3), 284–299 (1987)

    Article  Google Scholar 

  7. Singhal, M.: A dynamic information structure mutual exclusion in distributed system. IEEE Trans. Parallel. Distrib. Syst. 3(1), 121–125 (1992)

    Article  Google Scholar 

  8. Kakugawa, H., Yamashita, M.: Local coteries and a distributed resource allocation algorithm. Trans. Inf. Process. Soc. Japan 37(8), 1487–1496 (1996)

    Google Scholar 

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

    Article  Google Scholar 

  10. Housini, A., Trehel, M.: Distributed mutual exclusion token-permission based by prioritized groups. In: Proceedings of ACS/IEEE International Conference, pp. 253–259 (2001)

    Google Scholar 

  11. Mueller, F.: Prioritized token-based mutual exclusion for distributed systems. In: Proceedings of the 9th Symposium on Parallel and Distributed Processing, pp. 791–795 (1998)

    Google Scholar 

  12. Kanrar, S., Choudhury, S., Chaki, N.: A link-failure resilient token based mutual exclusion algorithm for directed graph topology. In: Proceedings of the 7th International Symposium on Parallel and Distributed Computing—ISPDC 2008 (2008)

    Google Scholar 

  13. Karnar, S., Chaki, N.: Modified Raymond’s algorithm for priority (MRA-P) based mutual exclusion in distributed systems. In: Proceedings of ICDCIT 2006. LNCS 4317, pp. 325–332 (2006)

    Google Scholar 

  14. Mittal, N., Mohan, P.K.: A priority-based distributed group mutual exclusion algorithm when group access is non-uniform. J. Parallel. Distrib. Comput. 67(7), 797–815 (2007)

    Article  MATH  Google Scholar 

  15. Barbara, D., Garcia-Molina, H., Spauster, A.: Increasing availability under mutual exclusion constraints with dynamic vote reassignment. ACM Trans. Comput. Syst. 7(4), 394–428 (1989)

    Article  Google Scholar 

  16. Zarafshan, F., Karimi, A., Al-Haddad, S.A.R., Saripan, M.I., Subramaniam, S.: A preliminary study on ancestral voting algorithm for availability improvement of mutual exclusion in partitioned distributed systems. In: Proceedings of International Conference on Computers and Computing (ICCC’11), pp. 61–69 (2011)

    Google Scholar 

  17. Kanrar, S., Chaki, N.: FAPP: A new fairness algorithm for priority process mutual exclusion in distributed systems. Special issue on recent advances in network and parallel computing. Int. J. Networks 5(1), 11–18 (2010). ISSN: 1796-2056

    Google Scholar 

  18. Naimi, M., Thiare, O.: Distributed mutual exclusion based on causal ordering. J. Comput. Sci. 398-404 (2009). ISSN 1549-3636

    Google Scholar 

  19. Chaki, N., Chaki, R., Saha, B., Chattopadhyay, T.: A new logical topology based on barrel shifter network over an all optical network. In: Proceedings of 28th IEEE International Conference on Local Computer Networks (LCN ‘03), pp. 283–284 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sukhendu Kanrar .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this chapter

Cite this chapter

Kanrar, S., Chaki, N., Chattopadhyay, S. (2018). Tree-Based Mutual Exclusions. In: Concurrency Control in Distributed System Using Mutual Exclusion. Studies in Systems, Decision and Control, vol 116. Springer, Singapore. https://doi.org/10.1007/978-981-10-5559-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-5559-1_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-5558-4

  • Online ISBN: 978-981-10-5559-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics