Skip to main content

FTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid Applications

  • Conference paper
Book cover Distributed Computing and Networking (ICDCN 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5408))

Included in the following conference series:

  • 761 Accesses

Abstract

We introduce FTRepMI, a simple fault-tolerant protocol for providing sequential consistency amongst replicated objects in a grid, without using any centralized components. FTRepMI supports dynamic joins and graceful leaves of processes holding a replica, as well as fail-stop crashes. Performance evaluation shows that FTRepMI behaves efficiently, both on a single cluster and on a distributed cluster environment.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bal, H., Kaashoek, F., Tanenbaum, A.: Orca: A language for parallel programming of distributed systems. IEEE TSE 18(3), 190–205 (1992)

    Google Scholar 

  2. Birman, K.: Replication and fault-tolerance in the Isis system. In: SOSP 1985, pp. 79–86. ACM, New York (1985)

    Google Scholar 

  3. Blom, S., Fokkink, W., Groote, J.F., van Langevelde, I., Lisser, B., van de Pol, J.: μCRL: A toolset for analysing algebraic specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 250–254. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Fekete, A., Kaashoek, M.F., Lynch, N.: Implementing sequentially consistent shared objects using broadcast and point-to-point communication. J. ACM 45(1), 35–69 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Garbinato, B., Guerraoui, R., Mazouni, K.R.: Implementation of the GARF replicated objects platform. Distributed Systems Engineering 2(1), 14–27 (1995)

    Article  Google Scholar 

  6. Grosso, P., Xu, L., Velders, J.-P., de Laat, C.: Starplane: A national dynamic photonic network controlled by grid applications. Emerald Journal on Internet Research 17(5), 546–553 (2007)

    Article  Google Scholar 

  7. Guerraoui, R., Schiper, A.: Fault-tolerance by replication in distributed systems. In: Strohmeier, A. (ed.) Ada-Europe 1996. LNCS, vol. 1088, pp. 38–57. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  8. Herlihy, M.: A quorum-consensus replication method for abstract data types. ACM TOCS 4(1), 32–53 (1986)

    Article  Google Scholar 

  9. Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE TOC 28(9), 690–691 (1979)

    MATH  Google Scholar 

  10. Lynch, N.A., Shvartsman, A.A.: RAMBO: A reconfigurable atomic memory service for dynamic networks. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 173–190. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Maassen, J.: Method Invocation Based Programming Models for Parallel Programming in Java. PhD thesis, Vrije Universiteit Amsterdam (2003)

    Google Scholar 

  12. Maassen, J., van Nieuwpoort, R., Veldema, R., Bal, H., Kielmann, T., Jacobs, C., Hofman, R.: Efficient Java RMI for parallel programming. ACM TOPLAS 23(6), 747–775 (2001)

    Article  Google Scholar 

  13. Maassen, J., Kielmann, T., Bal, H.: Parallel application experience with replicated method invocation. Concurrency and Computation: Practice and Experience 13(8-9), 681–712 (2001)

    Article  MATH  Google Scholar 

  14. Moser, L., Melliar-Smith, P., Agarwal, D., Budhia, R., Lingley-Papadopoulos, C.: Totem: A fault-tolerant multicast group communication system. Commun. ACM 39(4), 54–63 (1996)

    Article  Google Scholar 

  15. Narasimhan, P., Moser, L., Melliar-Smith, P.: Strongly consistent replication and recovery of fault-tolerant Corba applications. Computer System Science and Engineering 17(2), 103–114 (2002)

    Google Scholar 

  16. van Nieuwpoort, R., Maassen, J., Wrzesinska, G., Hofman, R., Jacobs, C., Kielmann, T., Bal, H.: Ibis: A flexible and efficient Java-based grid programming environment. Concurrency and Computation: Practice and Experience 17(7-8), 1079–1107 (2005)

    Article  Google Scholar 

  17. van Renesse, R., Schneider, F.: Chain replication for supporting high throughput and availability. In: OSDI 2004, pp. 91–104. USENIX Association (2004)

    Google Scholar 

  18. Schiper, A.: Practical impact of group communication theory. In: Schiper, A., Shvartsman, M.M.A.A., Weatherspoon, H., Zhao, B.Y. (eds.) Future Directions in Distributed Computing. LNCS, vol. 2584, pp. 1–10. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oprescu, AM., Kielmann, T., Fokkink, W. (2008). FTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid Applications. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds) Distributed Computing and Networking. ICDCN 2009. Lecture Notes in Computer Science, vol 5408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92295-7_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92295-7_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92294-0

  • Online ISBN: 978-3-540-92295-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics