Nothing Special   »   [go: up one dir, main page]

Skip to main content

Adaptive Algorithms

  • Chapter
  • First Online:
Recoverable Mutual Exclusion

Abstract

Although crash failures do occur in the real world, they are rare in practice. As a result, we expect most of the super-passages to be failure-free. Thus it is desirable to design RME algorithms whose RMR complexity adapts to the number of recent failures in the system. Ideally, such an algorithm would incur only \({O}\left( 1\right) \) RMRs in any passage that is not 0-failure-concurrent. In this chapter, we discuss different notions of adaptiveness and describe several RME algorithms that can adapt to the number of recent failures in the system.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook
USD 15.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 44.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. Sahil Dhoked and Neeraj Mittal. An adaptive approach to recoverable mutual exclusion. In Proc. of the 39th ACM Symposium on Principles of Distributed Computing (PODC), PODC ’20, pages 1–10, New York, NY, USA, 2020. Association for Computing Machinery.

    Google Scholar 

  2. Wojciech Golab and Aditya Ramaraju. Recoverable mutual exclusion. In Proc. of the 35th ACM Symposium on Principles of Distributed Computing (PODC), pages 65–74, 2016.

    Google Scholar 

  3. Wojciech Golab and Aditya Ramaraju. Recoverable mutual exclusion. Distributed Computing (DC), 32(6):535–564, 2019.

    Article  MathSciNet  MATH  Google Scholar 

  4. John M. Mellor-Crummey and Michael L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems (TOCS), 9(1):21–65, 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sahil Dhoked .

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Dhoked, S., Golab, W., Mittal, N. (2023). Adaptive Algorithms. In: Recoverable Mutual Exclusion. Synthesis Lectures on Distributed Computing Theory. Springer, Cham. https://doi.org/10.1007/978-3-031-20002-1_7

Download citation

Publish with us

Policies and ethics