Distributed load balancers exhibit thrashing where tasks are repeatedly moved between locations due to incomplete global load information. This talk shows that networks of Autonomous Mobile Programs (AMPs) exhibit the same behaviour, and identifies two types of redundant movement, termed greedy effects.
We establish three new properties of balanced networks of AMPs: independent balance, singleton and consecutive optimality. The properties are used to provide a theoretical analysis of greedy effects. An example theorem states that, after an AMP terminates in a heterogeneous network of q subnetworks, the number of redundant movements during rebalancing does not exceed $q − 1$.
Contact: Richard G. Clegg (richard@richardclegg.org) or Keith Briggs ()