Cluster Computing

, Volume 12, Issue 2, pp 175–188 | Cite as

FaTLease: scalable fault-tolerant lease negotiation with Paxos

  • Felix Hupfeld
  • Björn Kolbeck
  • Jan Stender
  • Mikael Högqvist
  • Toni Cortes
  • Jonathan Martí
  • Jesús Malo
Article

Abstract

A lease is a token which grants its owner exclusive access to a resource for a defined span of time. In order to be able to tolerate failures, leases need to be coordinated by distributed processes. We present FaTLease, an algorithm for fault-tolerant lease negotiation in distributed systems. It is built on the Paxos algorithm for distributed consensus, but avoids Paxos’ main performance bottleneck of requiring persistent state. This property makes our algorithm particularly useful for applications that can not dispense any disk bandwidth. Our experiments show that FaTLease scales up to tens of thousands of concurrent leases and can negotiate thousands of leases per second in both LAN and WAN environments.

Keywords

Leases High-availability Locks Paxos Replication 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Boichat, R., Dutta, P., Frolund, S., Guerraoui, R.: Deconstructing Paxos. SIGACT News 34(1), 47–67 (2003) CrossRefGoogle Scholar
  2. 2.
    Burrows, M.: Chubby distributed lock service. In: Proceedings of the 7th Symposium on Operating System Design and Implementation, OSDI’06, Seattle, WA, November 2006 Google Scholar
  3. 3.
    Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225–267 (1996) MATHMathSciNetGoogle Scholar
  4. 4.
    Chandra, T.D., Griesemer, R., Redstone, J.: Paxos made live: an engineering perspective. In: PODC ’07: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, New York, NY, pp. 398–407. ACM Press, New York (2007) Google Scholar
  5. 5.
    Ghemawat, S., Gobioff, H., Leung, S.-T.: The Google file system. In: SOSP ’03: Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles, New York, NY, pp. 29–43. ACM, New York (2003) CrossRefGoogle Scholar
  6. 6.
    Gray, C., Cheriton, D.: Leases: an efficient fault-tolerant mechanism for distributed file cache consistency. In: SOSP ’89: Proceedings of the Twelfth ACM Symposium on Operating Systems Principles, New York, NY, pp. 202–210. ACM, New York (1989) CrossRefGoogle Scholar
  7. 7.
    Hupfeld, F., Cortes, T., Kolbeck, B., Stender, J., Focht, E., Hess, M., Malo, J., Marti, J., Cesario, E.: XtreemFS: a case for object-based storage in Grid data management. In: 3rd VLDB Workshop on Data Management in Grids, Co-Located with VLDB 2007 (2007) Google Scholar
  8. 8.
    Jiménez-Peris, R., no Martínez, M.P., Alonso, G., Kemme, B.: Are quorums an alternative for data replication? ACM Trans. Database Syst. 28(3), 257–294 (2003) CrossRefGoogle Scholar
  9. 9.
    Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133–169 (1998) CrossRefGoogle Scholar
  10. 10.
    Lamport, L.: Paxos made simple. SIGACT News 32(4), 18–25 (2001) Google Scholar
  11. 11.
    Lampson, B.W.: How to build a highly available system using consensus. In: WDAG ’96: Proceedings of the 10th International Workshop on Distributed Algorithms, London, pp. 1–17. Springer, Berlin (1996) Google Scholar
  12. 12.
    MacCormick, J., Murphy, N., Najork, M., Thekkath, C.A., Zhou, L.: Boxwood: abstractions as the foundation for storage infrastructure. In: OSDI, pp. 105–120 (2004) Google Scholar
  13. 13.
    Prisco, R.D., Lampson, B., Lynch, N.: Revisiting the Paxos algorithm. Theor. Comput. Sci. 243(1–2), 35–91 (2000) MATHCrossRefGoogle Scholar
  14. 14.
    Thekkath, C.A., Mann, T., Lee, E.K.: Frangipani: a scalable distributed file system. Oper. Syst. Rev. 31(5), 224–237 (1997) CrossRefGoogle Scholar
  15. 15.
    van Renesse, R., Schneider, F.B.: Chain replication for supporting high throughput and availability. In: OSDI, pp. 91–104 (2004) Google Scholar
  16. 16.
    Welsh, M., Culler, D., Brewer, E.: Seda: an architecture for well-conditioned, scalable Internet services. Oper. Syst. Rev. 35(5), 230–243 (2001) CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Felix Hupfeld
    • 1
  • Björn Kolbeck
    • 1
  • Jan Stender
    • 1
  • Mikael Högqvist
    • 1
  • Toni Cortes
    • 2
  • Jonathan Martí
    • 2
  • Jesús Malo
    • 2
  1. 1.Zuse Institute BerlinBerlinGermany
  2. 2.Barcelona Supercomputing CenterBarcelonaSpain

Personalised recommendations