Empirical Comparison of Heuristic Load Distribution in Point-to-Point Multicomputer Networks
Dirk C. Grunwald, Bobby A. A. Nazief, Dan Reed · 2005
The study compared several load placement algorithms using instrumented programs and synthetic program models. Salient characteristics of these program traces (total computation time, total number of messages sent, and average message time) span two orders of magnitude. Load distribution algorithms determine the initial placement for processes, a precursor to the more general problem of load redistribution. It is found that desirable workload distribution strategies will place new processes globally, rather than locally, to spread processes rapidly, but that local information should be used to refine global placement.