Abstract
Computing systems are studied that consist of many (partially) autonomous workers and helpers which are connected via a network and where the helpers perform service tasks for the workers. In order to execute different service tasks the helpers have reconfigurable hardware. We address the problem to design a decentralized system where the requests of the workers are executed by suitable helpers and where the total reconfiguration costs of the helpers are small. A system is proposed that uses a combination of a fully decentralized and dynamic clustering algorithm and a self-organized task allocation system. The clustering algorithm is used to classify the service requests that are sent as packets through the network in order to give the helpers hints which packets are suitable to be executed by them. Simulations have been done for static and dynamic scenarios where we investigate the reconfiguration costs and the number of dropped packets, i.e., requests that could not be satisfied. The results show that the proposed system has a strong adaptive behavior and that the decentralized clustering is able to reduce the reconfiguration costs significantly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
GI: Organic Computing / VDE, ITG, GI - Positionspapier (2003), http://www.betriebssysteme.org/Betriebssysteme/FutureTrends/oc-positionspapier.pdf
Kephart, J.O., Chess, D.M.: The Vision of Autonomic Computing. IEEE Computer 36(1), 41–50 (2003)
Merkle, D., Middendorf, M., Scheidler, A.: Dynamic Decentralized Packet Clustering in Networks. In: Rothlauf, F., et al. (eds.) EvoWorkshops 2005. LNCS, vol. 3449, pp. 574–583. Springer, Heidelberg (2005)
Merkle, D., Middendorf, M., Scheidler, A.: Decentralized Packet Clustering in Router-based Networks. International Journal of Foundations of Computer Science 16(2), 321–341 (2005)
Merkle, D., Middendorf, M., Scheidler, A.: Self-Organized Task Allocation for Computing Systems with Reconfigurable Components. In: Proc. of the 9th International Workshop on Nature Inspired Distributed Computing (NIDISC 2006) (to be published, 2006)
Kaufman, L., Rousseuw, P.J.: Finding Groups in Data: An Introduction to ClusterAnalysis. Wiley, New York (1990)
Dunn, J.C.: A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. J. Cybern. 3(3), 32–57 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Merkle, D., Middendorf, M., Scheidler, A. (2006). Using Decentralized Clustering for Task Allocation in Networks with Reconfigurable Helper Units. In: de Meer, H., Sterbenz, J.P.G. (eds) Self-Organizing Systems. EuroNGI IWSOS 2006 2006. Lecture Notes in Computer Science, vol 4124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11822035_12
Download citation
DOI: https://doi.org/10.1007/11822035_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37658-3
Online ISBN: 978-3-540-37669-9
eBook Packages: Computer ScienceComputer Science (R0)