Data allocation in a dynamically reconfigurable environment

Abstract

The authors address the data allocation problem in a dynamically reconfigurable distributed database system. Following the description of the system model and the consequences of node movement, several dynamic allocation strategies are presented. A distributed candidate-selection algorithm using the data from the accounting system in the database servers is proposed to reduce the number of files and nodes considered in reallocation. The allocation algorithms choose the optimal assignment using heuristic benefit functions and greedy search strategy. The experimental results demonstrate the accuracy and efficiency of the allocation algorithms.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>