Skip to main content

Using Ant’s Brood Sorting to Increase Fault Tolerance in Linda’s Tuple Distribution Mechanism

  • Conference paper
Cooperative Information Agents XI (CIA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4676))

Included in the following conference series:

Abstract

Coordination systems have been used in a variety of different applications but have never performed well in large scale, faulty settings. The sheer scale and level of complexity of today’s applications is enough to make the current ways of thinking about distributed systems (e.g. deterministic decisions about data organization) obsolete. All the same, computer scientists are searching for new approaches and are paying more attention to stochastic approaches that provide good solutions “most of the time”. The trade-off here is that by loosening certain requirements the system ends up performing better in other fronts such as adaptiveness to failures. Adaptation is a key component to fault-tolerance and tuple distribution is the center of the fault-tolerance problem in tuple-space systems. Hence, this paper shows how the tuple distribution in Linda-like systems can be solved by using an adaptive self-organized approach à la Swarm Intelligence. The results discussed in this paper demonstrate that efficient and adaptive solutions to this problem can be achieved using simple and inexpensive approaches.

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. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. In: Santa Fe Institute Studies in the Sciences of Complexity, Oxford University Press, Inc., Oxford (1999)

    Google Scholar 

  2. Camazine, S., Deneubourg, J.-L., Franks, N., Sneyd, J., Theraula, G., Bonabeau, E.: Self-Organization in Biological Systems. Princeton Univ. Press, Princeton (2003)

    MATH  Google Scholar 

  3. Casadei, M., Gardelli, L., Viroli, M.: A case of self-organising environment for MAS: the collective sort problem. In: EUMAS 2006. 4th European Workshop on Multi-Agent Systems, EUMAS, Lisbon, Portugal (December 15, 2006) Warsaw University. Proceedings (2006)

    Google Scholar 

  4. Matteo, C., Luca, G., Mirko, V.: Simulating emergent properties of coordination in Maude: the collective sorting case (Proceedings). In: Carlos, C., Mirko, V. (eds.) FOCLASA 2006. CONCUR 2006, 5th International Workshop on Foundations of Coordination Languages and Software Architectures, Bonn, Germany, pp. 57–75. University of Málaga, Spain (2006)

    Google Scholar 

  5. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: Maude Manual. Department of Computer Science University of Illinois at Urbana-Champaign, 2.2 edn., Version 2.2 is available online (December 2005), at http://maude.cs.uiuc.edu

  6. Corradi, A., Leonardi, L., Zambonelli, F.: Strategies and protocols for highly parallel Linda servers. Software Practice and Experience 28(14), 1493–1517 (1998)

    Article  Google Scholar 

  7. Deneubourg, J.-L., Goss, S., Franks, N., Sendova-Franks, A., Detrain, C., Chretien, L.: The dynamic of collective sorting robot-like ants and ant-like robots. In: Proceedings of the First International Conference on Simulation of Adaptive Behavior: From Animals to Animats 3, pp. 356–365. MIT Press, Cambridge, MA (1991)

    Google Scholar 

  8. Gelernter, D., Carriero, N.: Coordination languages and their significance. Communications of the ACM 35(2), 96–107 (1992)

    Article  Google Scholar 

  9. Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  10. Mamei, M., Menezes, R., Tolksdorf, R., Zambonelli, F.: Case studies for self-organization in computer science. Journal of Systems Architecture 52(8-9), 443–460 (2006)

    Article  Google Scholar 

  11. Mamei, M., Zambonelli, F., Leonardi, L.: Tuples on the air: A middleware for context-aware computing in dynamic networks. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, p. 342. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  12. Menezes, R., Tolksdorf, R.: A new approach to scalable linda-systems based on swarms. In: Proceedings of the ACM Symposium on Applied Computing, ACM Press, New York (2003)

    Google Scholar 

  13. Ossowski, S., Menezes, R.: On coordination and its significance to distributed and multi-agent systems. Concurrency and Computation: Practice and Experience 18(4), 359–370 (2006)

    Article  Google Scholar 

  14. Parunak, H.: Go to the ant: Engineering principles from natural multi-agent systems. Annals of Operations Research 75, 69–101 (1997)

    Article  MATH  Google Scholar 

  15. Priami, C.: Stochastic pi-calculus. The Computer Journal 38(7), 578–589 (1995)

    Article  Google Scholar 

  16. Spafford, E., DeMillo, R.: Grand research challenges in information systems. Technical report, Computing Research Association (2003), http://www.cra.org/reports/gc.systems.pdf

  17. Tolksdorf, R.: Laura | A service-based coordination language. Science of Computer Programming 31(2–3), 359–381 (1998)

    Article  MATH  Google Scholar 

  18. Tolksdorf, R., Menezes, R.: Using swarm intelligence in linda systems. In: Omicini, A., Petta, P., Pitt, J. (eds.) ESAW 2003. LNCS (LNAI), vol. 3071, Springer, Heidelberg (2004)

    Google Scholar 

  19. UK Computing Research Committee. Grand challenges in computer research. Technical report, British Computing Society (2004), http://www.bcs.org/upload/pdf/gcresearch.pdf

  20. Wyckoff, P., McLaughry, S.W., Lehman, T.J., Ford, D.A.: T Spaces. IBM Systems Journal (Special Issue on Java Technology), 37(3) (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Matthias Klusch Koen V. Hindriks Mike P. Papazoglou Leon Sterling

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Casadei, M., Menezes, R., Viroli, M., Tolksdorf, R. (2007). Using Ant’s Brood Sorting to Increase Fault Tolerance in Linda’s Tuple Distribution Mechanism. In: Klusch, M., Hindriks, K.V., Papazoglou, M.P., Sterling, L. (eds) Cooperative Information Agents XI. CIA 2007. Lecture Notes in Computer Science(), vol 4676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75119-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75119-9_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75118-2

  • Online ISBN: 978-3-540-75119-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics