The p-shovelers problem-computing with time-varying data

Abstract

The authors consider problems whose size varies with time, and discuss the organization and analysis of algorithms for them. They prove that the benefits of a parallel solution may be greater than usual, they also prove that the standard lower and upper bounds on parallel speed-up do not hold in this case, and must be reformulated.<>