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

  • Authors:

  • Luccio; Pagli

  • Affiliations:

  • Dipartimento di Inf., Pisa Univ., Italy;Dipartimento di Inf., Pisa Univ., Italy

  • Venue:
  • SPDP '92 Proceedings of the 1992 Fourth IEEE Symposium on Parallel and Distributed Processing
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

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.