Skip to main content
SpringerLink
Log in
Book cover

International Conference on Advanced Information Networking and Applications

AINA 2019: Advanced Information Networking and Applications pp 272–285Cite as

On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion

  • Conference paper
  • First Online:

  • 1774 Accesses

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

Abstract

Failure detectors are devices (objects) that provides the processes with information on failures. They were introduced to enrich asynchronous systems so that it becomes possible to solve problems (or implement concurrent objects) that are otherwise impossible to solve in pure asynchronous systems where processes are prone to crash failures. The most famous failure detector (which is called “eventual leader” and denoted \(\varOmega \)) is the weakest failure detector which allows consensus to be solved in n-process asynchronous systems where up to \(t=n-1\) processes may crash in the read/write communication model, and up to \(t<n/2\) processes may crash in the message-passing communication model.

When looking at the mutual exclusion problem (or equivalently the construction of a lock object), while the weakest failure detectors are known for both asynchronous message-passing systems and read/write systems in which up to \(t<n\) processes may crash, for the starvation-freedom progress condition, it is not yet known for weaker deadlock-freedom progress condition in read/write systems. This paper extends the previous results, namely, it presents the weakest failure detector that allows mutual exclusion to be solved in asynchronous n-process read/write systems where any number of processes may crash, whatever the progress condition (deadlock-freedom or starvation-freedom).

This is a preview of subscription content, 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   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

References

  1. Bhatt, V., Christman, N., Jayanti, P.: Extracting quorum failure detectors. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC 2009), pp. 73–82. ACM Press (2009)

    Google Scholar 

  2. Bhatt, V., Jayanti, P.: On the existence of weakest failure detectors for mutual exclusion and k-exclusion. In: 23rd International Symposium on Distributed Computing (DISC 2009), LNCS, vol. 5805, pp. 325–339. Springer (2009)

    Google Scholar 

  3. Bonnet, F., Raynal, M.: A simple proof of the necessity of the failure detector \(\varSigma \) to implement an atomic register in asynchronous message-passing systems. Inf. Process. Lett. 110(4), 153–157 (2010)

    Article  MathSciNet  Google Scholar 

  4. Chandra, T., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685–722 (1996)

    Article  MathSciNet  Google Scholar 

  5. Chandra, T., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225–267 (1996)

    Article  MathSciNet  Google Scholar 

  6. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: A Realistic look at failure detectors. In: Proceedings of the 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2002), pp. 345–353. IEEE Computer Press (2002)

    Google Scholar 

  7. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Tight failure detection bounds on atomic object implementations. J. ACM 57(4), 32 (2010). Article 22

    MathSciNet  MATH  Google Scholar 

  8. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Kouznetsov, P., Toueg, S.: The weakest failure detectors to solve certain fundamental problems in distributed computing. In: Proceedings of the 23th ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 338-346. ACM Press (2004)

    Google Scholar 

  9. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kouznetsov, P.: Mutual exclusion in asynchronous systems with failure detectors. J. Parallel Distrib. Comput. 65, 492–505 (2005)

    Article  Google Scholar 

  10. Delporte-Gallet, C., Fauconnier, H., Raynal, M.: Fair synchronization in the presence of process crashes and its weakest failure detector. In: 33rd IEEE International Symposium on Reliable Distributed Systems, (SRDS 2014), pp. 161–170. IEEE Press (2014)

    Google Scholar 

  11. Dijkstra, E.W.: Solution of a problem in concurrent programming control. Commun. ACM 8(9), 569 (1965)

    Article  Google Scholar 

  12. Fernández, A., Jiménez, E., Raynal, M., Trédan, G.: A timing assumption and two \(t\)-resilient protocols for implementing an eventual leader service in asynchronous shared-memory systems. Algorithmica 56(4), 550–576 (2010)

    Article  MathSciNet  Google Scholar 

  13. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)

    Article  MathSciNet  Google Scholar 

  14. Hélary, J.-M., Hurfin, M., Mostéfaoui, A., Raynal, M., Tronel, F.: Computing global functions in asynchronous distributed systems with perfect failure detectors. IEEE Trans. Parallel Distrib. Syst. 11(9), 897–909 (2000)

    Article  Google Scholar 

  15. Lamport, L.: A new solution of Dijkstra’s concurrent programming problem. Commun. ACM 17(8), 453–455 (1974)

    Article  MathSciNet  Google Scholar 

  16. Lo, W.-K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared memory systems. In: Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG 1994), LNCS, vol. 857, pp. 280–295. Springer (1994)

    Google Scholar 

  17. Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163–183 (1987)

    MathSciNet  Google Scholar 

  18. Raynal, M.: Concurrent Programming: Algorithms, Principles, and Foundations, p. 515. Springer (2013). ISBN 978-3-642-32027-9

    Google Scholar 

  19. Raynal, M.: Fault-Tolerant Message-passing Distributed Systems: An Algorithmic Approach, p. 492. Springer (2018). ISBN: 978-3-319-94140-0

    Google Scholar 

  20. Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming, p. 423. Pearson Education/Prentice Hall (2006). ISBN 0-131-97259-6

    Google Scholar 

Download references

Acknowledgments

This work was partially supported by the French ANR project 16-CE40-0023-03 (16-CE40-0023-03) devoted to layered and modular structures in distributed computing.

Author information

Authors and Affiliations

  1. IRIF, Université Paris 7 Diderot, Paris, France

    Carole Delporte-Gallet & Hugues Fauconnier

  2. IRISA, Université de Rennes, 35042, Rennes, France

    Michel Raynal

  3. Department of Computing, Polytechnic University, Kowloon, Hong Kong

    Michel Raynal

Authors
  1. Carole Delporte-Gallet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hugues Fauconnier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michel Raynal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michel Raynal .

Editor information

Editors and Affiliations

  1. Department of Information and Communication Engineering, Fukuoka Institute of Technology, Fukuoka, Japan

    Leonard Barolli

  2. Department of Advanced Sciences, Hosei University, Koganei-Shi, Tokyo, Japan

    Makoto Takizawa

  3. Department of Computer Science, Technical University of Catalonia, Barcelona, Barcelona, Spain

    Fatos Xhafa

  4. Faculty of Business Administration, Rissho University, Tokyo, Japan

    Tomoya Enokido

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Delporte-Gallet, C., Fauconnier, H., Raynal, M. (2020). On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion. In: Barolli, L., Takizawa, M., Xhafa, F., Enokido, T. (eds) Advanced Information Networking and Applications. AINA 2019. Advances in Intelligent Systems and Computing, vol 926. Springer, Cham. https://doi.org/10.1007/978-3-030-15032-7_24

Download citation

Publish with us

Policies and ethics

Search

Navigation