Improving dynamic load balancing mechanisms for a massively parallel database programming language

This paper discusses dynamic load balancing mechanisms for a massively parallel database programming language. Instead of accurate information on object allocation, the proposed approach utilizes approximate information to determine the relocation candidate objects and the destination. The simulation tests reported in this paper confirms the performance improvement achieved by the proposed approach.