Title :
The p-shovelers problem-computing with time-varying data
Author :
Luccio, Fabrizio ; Pagli, Linda
Author_Institution :
Dipartimento di Inf., Pisa Univ., Italy
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
Keywords :
parallel algorithms; lower bounds; p-shovelers problem; parallel solution; parallel speed-up; time-varying data; upper bounds; Algorithm design and analysis; Computer science; Concurrent computing; Operating systems; Parallel algorithms; Phase change random access memory; Physics; Random variables; Snow; Upper bound;
Conference_Titel :
Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium on
Conference_Location :
Arlington, TX
Print_ISBN :
0-8186-3200-3
DOI :
10.1109/SPDP.1992.242745
