Abstract
This paper presents an alternative view on the speedup of parallel processing. Three models of parallel speedup are studied: fixed-size speedup, fixed-time speedup, and a new memory-bounded speedup model. The memory-bounded model considers the relationship between problem size scaling and available memory, providing a more realistic measure of parallel system performance than traditional fixed-size speedup.