Load‐sharing algorithms for parallel database processing on shared‐everything multiprocessors

Abstract

SUMMARYThis paper describes new load-sharing algorithms for parallel database processing. There is a trade-off between overhead and load unbalance in ordinary algorithms. The proposed algorithms solve the tradeoff by varying the number of tasks allocated at one time, which is fixed in ordinary algorithms. Performance evaluations show that the proposed algorithms achieve fair load sharing with low overhead, independent of database size, the number of processors and data distribution.