Skip to main content

Mobile Co-ordination: Providing Fault Tolerance in Tuple Space Based Co-ordination Languages

  • Conference paper
  • First Online:
Coordinatio Languages and Models (COORDINATION 1999)

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

Included in the following conference series:

Abstract

In this paper we describe the concept of mobile co-ordination, a general purpose approach to overcoming failure of agents when using distributed tuple spaces. We demonstrate why mobile co-ordination is better than using existing techniques such as transactions, how mobile co-ordination can provide extra functionality in the form of agent wills, and how the framework to provide this can be implemented in Java and can be used with multiple different tuple space co-ordination languages. Experimental results are presented to show performance gains made when mobile co-ordination is used.

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. N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444–458, 1989.

    Article  Google Scholar 

  2. B. Anderson and D. Shasha. Persistent Linda: Linda + Transactions + Query Processing. In Research Directions in High-Level Parallel Programming Languages, LNCS 574, 1991.

    Google Scholar 

  3. K. Jeong and D. Shasha. Persistent Linda 2: a transaction/checkpointing approach to fault-tolerant linda. In Proceedings of the 13th Symposium on Fault-Tolerant Distributed Systems, 1994.

    Google Scholar 

  4. Scientific Computing Associates. Paradise: User’s guide and reference manual. Scientific Computing Associates, 1996.

    Google Scholar 

  5. Sun Microsystems. Javaspaces specification. Avaliable from Sun Microsystems WWW Site (http://java.sun.com/products/javaspaces), 1998.

  6. P. Wyckoff, S. McLaughry, T. Lehman, and D. Ford. TSpaces. To appear in IBM Systems Journal, August, 1998.

    Google Scholar 

  7. A. Rowstron. Using asynchronous tuple space access primitives (bonita primitives) for process co-ordination. In Coordination 1997, pages 426–429, 1997.

    Google Scholar 

  8. A. Rowstron. WCL: A web co-ordination language. World Wide Web Journal, 1998.

    Google Scholar 

  9. A. Rowstron. Bulk primitives in Linda run-time systems. PhD thesis, Department of Computer Science, University of York, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rowstron, A. (1999). Mobile Co-ordination: Providing Fault Tolerance in Tuple Space Based Co-ordination Languages. In: Ciancarini, P., Wolf, A.L. (eds) Coordinatio Languages and Models. COORDINATION 1999. Lecture Notes in Computer Science, vol 1594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48919-3_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-48919-3_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65836-8

  • Online ISBN: 978-3-540-48919-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics