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.
Scheidler
Alexander
A
Department of Computer Science, University of Leipzig, Johannisgasse 26, 04103, Leipzig, Germany. scheidler@informatik.uni-leipzig.de
Merkle
Daniel
D
Middendorf
Martin
M
D000818:Animals; D001000:Ants / Q000502:physiology*; D001185:Artificial Intelligence; D001522:Behavior, Animal / Q000502:physiology*; D032701:Biomimetics / Q000379:methods*; D008954:Models, Biological; D012919:Social Behavior; D013647:Task Performance and Analysis