Stability and performance of ant queue inspired task partitioning methods

In this paper, we consider computing systems that have autonomous helper components which fulfill support functions and that possess reconfigurable hardware so that they can specialize to different types of service tasks. Several self-organized task partitioning methods are proposed that can be used by the helper components to decide how to reconfigure and which service tasks to execute. The proposed task partitioning methods are inspired by the so-called ant queue system that can be found in real ants for partitioning tasks between the individuals. The aim of this study is to investigate basic properties of the task partitioning methods, like stability and efficiency, in order to obtain basic insights into the design of task partitioning methods in self-organized service systems. More precisely, the investigations are threefold: (1) discrete event simulations are used to investigate systems, (2) for a simple version of the task partitioning system analytical stability results are obtained by means of delay differential equation systems and (3) by numerically solving initial value problems.

[1]  K. Cooke,et al.  Discrete delay, distributed delay and stability switches , 1982 .

[2]  Stephen F. Smith,et al.  Wasp nests for self-configurable factories , 2001, AGENTS '01.

[3]  Marco Dorigo,et al.  Division of labor in a group of robots inspired by ants' foraging behavior , 2006, TAAS.

[4]  Stephen F. Smith,et al.  Wasp-like Agents for Distributed Factory Coordination , 2004, Autonomous Agents and Multi-Agent Systems.

[5]  Rolf P. Würtz,et al.  Organic Computing , 2004, Informatik-Spektrum.

[6]  Carl Anderson,et al.  Task Partitioning in Insect Societies. II. Use of Queueing Delay Information in Recruitment , 1999, The American Naturalist.

[7]  Daniel Merkle,et al.  Using Decentralized Clustering for Task Allocation in Networks with Reconfigurable Helper Units , 2006, IWSOS/EuroNGI.

[8]  R. Jeanne,et al.  The organization of work in Polybia occidentalis: costs and benefits of specialization in a social wasp , 1986, Behavioral Ecology and Sociobiology.

[9]  Guy Theraulaz,et al.  Response Threshold Reinforcement and Division of Labor in Insect Societies , 1998 .

[10]  Linda Dailey Paulson,et al.  Computer System, Heal Thyself , 2002, Computer.

[11]  Guy Theraulaz,et al.  Dynamic Scheduling and Division of Labor in Social Insects , 2000, Adapt. Behav..

[12]  Guy Theraulaz,et al.  Task differentiation in Polistes wasp colonies: a model for self-organizing groups of robots , 1991 .

[13]  Hartmut Schmeck,et al.  Organic Computing - A New Vision for Distributed Embedded Systems , 2005, ISORC.

[14]  Daniel Merkle,et al.  Self-organized task allocation for computing systems with reconfigurable components , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[15]  J. Fewell,et al.  Models of division of labor in social insects. , 2001, Annual review of entomology.

[16]  Guy Theraulaz,et al.  Adaptive Task Allocation Inspired by a Model of Division of Labor in Social Insects , 1997, BCEC.

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

[18]  F. Ratnieks,et al.  Task Partitioning in Insect Societies. I. Effect of Colony Size on Queueing Delay and Colony Ergonomic Efficiency , 1999, The American Naturalist.

[19]  Stephen F. Smith,et al.  Insect Societies and Manufacturing , 2001, IJCAI 2001.

[20]  Maja J. Mataric,et al.  Adaptive division of labor in large-scale minimalist multi-robot systems , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[21]  Mauro Birattari,et al.  An Insect-Based Algorithm for the Dynamic Task Allocation Problem , 2005, Künstliche Intell..

[22]  Laurent Keller,et al.  Ant-like task allocation and recruitment in cooperative robots , 2000, Nature.

[23]  David Patterson,et al.  Self-repairing computers. , 2003, Scientific American.