Click here for full text:
Algorithms for Self-Organization and Adaptive Service Placement in Dynamic Distributed Systems
Andrzejak, Artur; Graupner, Sven; Kotov, Vadim; Trinks, Holger
HPL-2002-259
Keyword(s): self-organizing algorithms; adaptive service placement; distributed systems; grid systems
Abstract: In this paper we consider distributed computing systems which exhibit dynamism due to their scale or inherent design, e.g. inclusion of mobile components. Prominent examples are Grids - large networks where computing resources can transparently be shared and utilized for solving complex compute tasks. One of the hard problems in this domain is the resource allocation problem and the related service placement problem. In this paper we discuss distributed and adaptive resource allocation algorithms performed in such dynamic systems. These algorithms assume that no global information about resource availability and service demand can be provided due to the scale and dynamism. Interesting aspects of our approaches are the capabilities of self-organization and fault- tolerance. We analyze and "factor-out" these capabilities, making them also usable in the setting of other dynamic distributed systems, for example in mobile computing .
14 Pages
Back to Index
| 
printable version
