Advertisement

Using Decentralized Clustering for Task Allocation in Networks with Reconfigurable Helper Units

  • Daniel Merkle
  • Martin Middendorf
  • Alexander Scheidler
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4124)

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.

Keywords

Service Request Task Allocation Cluster Number Service Task Drop Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    GI: Organic Computing / VDE, ITG, GI - Positionspapier (2003), http://www.betriebssysteme.org/Betriebssysteme/FutureTrends/oc-positionspapier.pdf
  2. 2.
    Kephart, J.O., Chess, D.M.: The Vision of Autonomic Computing. IEEE Computer 36(1), 41–50 (2003)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)zbMATHCrossRefGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Kaufman, L., Rousseuw, P.J.: Finding Groups in Data: An Introduction to ClusterAnalysis. Wiley, New York (1990)CrossRefGoogle Scholar
  7. 7.
    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)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Daniel Merkle
    • 1
  • Martin Middendorf
    • 1
  • Alexander Scheidler
    • 1
  1. 1.Parallel Computing and Complex Systems Group, Department of Computer ScienceUniversity of LeipzigLeipzigGermany

Personalised recommendations