| Title |
A Self-Organising Solution to the Collective Sort Problem for Distributed
Tuple Spaces |
| Authors |
Mirko Viroli, Matteo Casadei, Luca Gardelli |
| Type |
In Conference Proceedings |
| Booktitle |
22th ACM Symposium on Applied Computing (SAC'07) |
| Pages |
354--359 |
| Address |
New York, NY, USA |
| Publisher |
ACM Press |
| Year |
2007 |
| ISBN |
1-59593-480-4 |
| DOI |
http://doi.acm.org/10.1145/1244002.1244086 |
| Note |
Special Track on Coordination Models, Languages and Applications |
| 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. |
| |
|
