A performance study of dynamic load balancing algorithms for multicomputers

Abstract

Multicomputers are often dedicated to specialized applications. However, they are increasingly based on general purpose microprocessors, so they can be used for general purpose applications if they provide some support to users, as load balancing. To better understand the behavior of load-balancing algorithms on multicomputers, we have developed a simulation environment using QNAP. The originality of our approach is that we take parallel computers constraints into account and evaluate the ability of load-balancing algorithms to behave as distributed schedulers. The paper gives the first results and comments on this simulation.<>