The dynamics of collective sorting robot-like ants and ant-like robots
Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Laura—a service-based coordination language
Science of Computer Programming
Strategies and protocols for highly parallel Linda servers
Software—Practice & Experience
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Swarm intelligence
Coordination languages and their significance
Communications of the ACM
Self-Organization in Biological Systems
Self-Organization in Biological Systems
Tuples On The Air: A Middleware for Context-Aware Computing in Dynamic Networks
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A new approach to scalable Linda-systems based on swarms
Proceedings of the 2003 ACM symposium on Applied computing
IBM Systems Journal
On coordination and its significance to distributed and multi-agent systems: Research Articles
Concurrency and Computation: Practice & Experience - Coordination Models and Systems
Case studies for self-organization in computer science
Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Nature-inspired applications and systems
Biochemical Tuple Spaces for Self-organising Coordination
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Emerge-Sort: swarm intelligence sorting
SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
On competitive self-composition in pervasive services
Science of Computer Programming
Hi-index | 0.00 |
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 à 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.