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.

中文翻译：

---

蚂蚁队列启发的任务划分方法的稳定性和性能。

在本文中，我们考虑具有自主辅助组件的计算系统，这些组件可以完成支持功能并拥有可重构的硬件，以便它们可以专门用于不同类型的服务任务。提出了几种自组织任务划分方法，帮助程序组件可以使用这些方法来决定如何重新配置​​以及执行哪些服务任务。所提出的任务划分方法受到所谓的蚂蚁队列系统的启发，该系统可以在真实的蚂蚁中找到，用于在个体之间划分任务。本研究的目的是研究任务划分方法的基本特性，如稳定性和效率，以获得对自组织服务系统中任务划分方法设计的基本见解。更准确地说，调查有三个方面：