Dynamic Fragment Allocation in Distributed System with Time-Varying Parameters of its Operation

Abstract

The problem of dynamic fragment allocation in a distributed data processing system is considered in the article. The model of dynamic redistribution of table fragments is described. A heuristic algorithm for placing fragments depending on the current parameters of a distributed system is presented.