Publications » Class » CollectivesortCoordSac07

A Self-Organising Solution to the Collective Sort Problem in Distributed Tuple Spaces

Mirko Viroli, Matteo Casadei, Luca Gardelli
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.
SAC '07: Proceedings of the 2007 ACM Symposium on Applied Computing, pages 354-359, 2007.
Alessandro Ricci, Michael Schumacher, Bernard Angerer (eds.), ACM , New York, NY, USA
@inproceedings{collectivesort-coord-sac07,
	title = {A Self-Organising Solution to the Collective Sort Problem in Distributed Tuple Spaces},
	address = {New York, NY, USA},
	booktitle = {SAC '07: Proceedings of the 2007 ACM Symposium on Applied Computing},
	publisher = {ACM },
	doi = {10.1145/1244002.1244086},
	isbn = {1-59593-480-4},
	editor = {Ricci, Alessandro and Schumacher, Michael and Angerer, Bernard },
	year = 2007,
	pages = {354--359},
	author = {Viroli, Mirko and Casadei, Matteo and Gardelli, Luca}}