Efficient Load Balancing in Partitioned Queries Under Random Perturbations

This paper investigates a particular instance of the problem of designing efficient adaptive systems, under the condition that each adaptation decision incurs some non negligible cost when enacted. More specifically, they deal with the problem of dynamic, intra-query load balancing in parallel database queries across heterogeneous nodes in a way that takes into account the inherent cost of adaptations and thus avoids both over-reacting and deciding when to adapt in a completely heuristic manner. The latter may lead to serious performance degradation in several cases, such as periodic and random imbalances.

Provided by: Association for Computing Machinery Topic: Data Management Date Added: Nov 2010 Format: PDF

Find By Topic