A self-organising solution to the collective sort problem in distributed tuple spaces

Authors:
Mirko Viroli;Matteo Casadei;Luca Gardelli
Affiliations:
Universitá di Bologna, Cesena (FC), Italy;Universitá di Bologna, Cesena (FC), Italy;Universitá di Bologna, Cesena (FC), Italy
Venue:
Proceedings of the 2007 ACM symposium on Applied computing
Year:
2007

Citing 4
Cited 3

Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
Programming Pervasive and Mobile Computing Applications with the TOTA Middleware

PERCOM '04 Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications (PerCom'04)
Formal modeling and quantitative analysis of KLAIM-based mobile systems

Proceedings of the 2005 ACM symposium on Applied computing
On the role of simulations in engineering self-organising MAS: the case of an intrusion detection system in TuCSoN

ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems

Designing self-organising environments with agents and artefacts: a simulation-driven approach

International Journal of Agent-Oriented Software Engineering
On the collective sort problem for distributed tuple spaces

Science of Computer Programming
An experience on probabilistic model checking and stochastic simulation to design self-organizing systems

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coordination languages and models are recently moving towards the application of techniques coming from the research context of complex systems: adaptivity and self-organisation are exploited in order to tackle typical features of systems to coordinate, such as openness, dynamism and unpredictability. In this paper we focus on a paradigmatic problem we call collective sort, where autonomous agents are assigned the task of moving tuples across different tuple spaces with the goal of reaching perfect clustering: tuples of the same kind are to be collected in the same, unique tuple space. We describe a self-organising solution to this problem, where each agent moves tuples according to partial observations, still making complete sorting emerge from any initial tuple configuration.