A performance study on load balancing algorithms with task migration

We present a performance study on three different load balancing algorithms. The first algorithm employs only task assignment, whereas the other two allow both task assignment and migration. We conclude that although task migration usually costs more than task assignment, under some situations it can augment task assignment to provide extra performance improvement. This is because task migration provides an alternate mechanism for distributing workload in a distributed system. The performance improvement by using this approach is especially significant when a heavily-loaded node has no appropriate tasks for assignment.<
>