Abstract:
It is demonstrated that supra-linear (greater than linear) speedup is possible in processing distributed divisible computational loads when computation time is a nonlinear function of load size. This result is radically different from the traditional distributed processing of divisible computational loads with linear processing complexity appearing in over 50 journal papers.