Skip to main content
SpringerLink
Log in

A Fault-Tolerant h-Out of-k Mutual Exclusion Algorithm Using Cohorts Coteries for Distributed Systems

  • Conference paper
Parallel and Distributed Computing: Applications and Technologies (PDCAT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3320))

Abstract

In this paper, we propose a distributed algorithm for solving the h-out of-k mutual exclusion problem with the aid of a specific k-coterie — cohorts coterie. The proposed algorithm is resilient to node and/or link failures, and has constant message cost in the best case. Furthermore, it is a candidate to achieve the highest availability among all the algorithms using k-coteries. We analyze the algorithm and compare it with other related ones.

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 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. Baldoni, R.: An O(N M/(M + 1)) Distributed Algorithm for the k-out of-M Resources Allocation Problem. In: 14th IEEE International Conference on Distributed Computing Systems, pp. 81–88 (1994)

    Google Scholar 

  2. Baldoni, R., Manabe, Y., Raynal, M., Aoyagy, S.: k-Arbiter: A Safe and General Scheme for h-out of-k Mutual Exclusion. Theoretical Computer Science 193, 97–112 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Huang, S.-T., Jiang, J.-R., Kuo, Y.-C.: k-Coteries for Fault-Tolerant k Entries to a Critical Section. In: 13th IEEE International Conference on Distributed Computing Systems, pp. 74–81 (1993)

    Google Scholar 

  4. Jiang, J.-R., Huang, S.-T., Kuo, Y.-C.: Cohorts Structures for Fault-Tolerant k Entries to a Critical Section. IEEE Trans. on Computers 48, 222–228 (1997)

    Article  Google Scholar 

  5. Jiang, J.-R.: Distributed h-out of-k Mutual Exclusion Using k-Coteries. In: 3rd International Conference on Parallel and Distributed Computing, Application and Technologies (PDCAT 2002), pp. 218–226 (2002)

    Google Scholar 

  6. Jiang, J.-R.: On the Nondomination of Cohorts Coteries. IEEE Trans. on Computers 53, 922–923 (2004)

    Article  Google Scholar 

  7. Lamport, L.: Time, Clocks, and the Ordering of Events in a Distributed System. Communications of ACM 21, 558–565 (1978)

    Article  MATH  Google Scholar 

  8. Meakawa, M.: A √N Algorithm for Mutual Exclusion in Decentralized Systems. ACM Trans. Comp. Sys. 3, 145–159 (1985)

    Article  Google Scholar 

  9. Manabe, Y., Tajima, N. (h-k)-Arbiter for h-out of-k Mutual Exclusion Problem. Theoretical Computer Science 310, 379–392 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  10. Raynal, M.: A Distributed Solution for the k-out of-m Resources Allocation Problem. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds.) ICCI 1991. LNCS, vol. 497, pp. 599–609. Springer, Heidelberg (1991)

    Google Scholar 

  11. Ricart, G., Agrawala, A.K.: An Optimal Algorithm for Mutual Exclusion in Computer Networks. Communications of ACM 24, 9–17 (1981)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Central University, Jhongli, 320, Taiwan

    Jehn-Ruey Jiang

Authors
  1. Jehn-Ruey Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Nanyang Centre for Supercomputing and Visualisation School of Mechanical and Production Engineering, Nanyang Technological University, 50 Nanyang Avenue, 639 798, Singapore

    Kim-Meow Liew

  2. School of Computer Science, The University of Adelaide,  

    Hong Shen

  3. Asia Pacific Science and Technology Center, Sun Microsystems Inc., 50 Nanyang Avenue, N3-1c-10, 639798, Singapore

    Simon See

  4. School of Computer Engineering, Nanyang Technological University, 639798, Singapore

    Wentong Cai

  5. Southwest Jiaotong University,  

    Pingzhi Fan

  6. Tohoku University ,  

    Susumu Horiguchi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, JR. (2004). A Fault-Tolerant h-Out of-k Mutual Exclusion Algorithm Using Cohorts Coteries for Distributed Systems. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30501-9_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24013-6

  • Online ISBN: 978-3-540-30501-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation