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

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 a laSwarm Intelligence. The results discussed in this paper demonstrate that efficient and adaptive solutions to this problem can be achieved using simple and inexpensive approaches.

[1]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[2]  Sascha Ossowski,et al.  On coordination and its significance to distributed and multi‐agent systems , 2006, Concurr. Comput. Pract. Exp..

[3]  Guy Theraulaz,et al.  Self-Organization in Biological Systems , 2001, Princeton studies in complexity.

[4]  H. Van Dyke Parunak,et al.  "Go to the ant": Engineering principles from natural multi-agent systems , 1997, Ann. Oper. Res..

[5]  J. van Leeuwen,et al.  Engineering Societies in the Agents World II , 2001, Lecture Notes in Computer Science.

[6]  Franco Zambonelli,et al.  Case studies for self-organization in computer science , 2006, J. Syst. Archit..

[7]  Jean-Louis Deneubourg,et al.  The dynamics of collective sorting robot-like ants and ant-like robots , 1991 .

[8]  Ronaldo Menezes,et al.  A new approach to scalable Linda-systems based on swarms , 2003, SAC '03.

[9]  Tobin J. Lehman,et al.  T Spaces , 1998, IBM Syst. J..

[10]  Franco Zambonelli,et al.  Strategies and protocols for highly parallel Linda servers , 1998 .

[11]  Nicholas Carriero,et al.  Coordination languages and their significance , 1992, CACM.

[12]  Corrado Priami,et al.  Stochastic pi-Calculus , 1995, Comput. J..

[13]  Mirko Viroli,et al.  A Case of Self-Organising Environment for MAS: the Collective Sort Problem , 2006, EUMAS.

[14]  Ronaldo Menezes,et al.  Using Swarm Intelligence in Linda Systems , 2003, ESAW.

[15]  Franco Zambonelli,et al.  Tuples on the air: a middleware for context-aware computing in dynamic networks , 2003, 23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings..

[16]  Robert Tolksdorf Laura - A Service-Based Coordination Language , 1998, Sci. Comput. Program..