Accession Number : ADA259227


Title :   Scalable Problems and Memory-Bounded Speedup


Descriptive Note : Contractor rept.,


Corporate Author : INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING HAMPTON VA


Personal Author(s) : Sun, Xian-He ; Ni, Lionel M


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a259227.pdf


Report Date : Nov 1992


Pagination or Media Count : 24


Abstract : In this paper three models of parallel speedup are studied. They are fixed-size speedup, fixed-time speedup and memory-bounded speedup. The latter two consider the relationship between speedup and problem scalability. Two sets of speedup formulations are derived for these three models. One set considers uneven workload allocation and communication overhead and gives more accurate estimation. Another set considers a simplified case and provides a clear picture on the impact of the sequential portion of an application on the possible performance gain from parallel processing. The simplified fixed-size speedup is Amdahl's law. The simplified fixed-time speedup is Gustafson's scaled speedup. The simplified memory-bounded speedup contains both Amdahl's law and Gustafson's scaled speedup as special cases. This study leads to a better understanding of parallel processing.... Parallel processing, Performance prediction, Speedup.


Descriptors :   *PARALLEL PROCESSING , *OPERATIONAL EFFECTIVENESS , IMPACT , PREDICTIONS , TIME , ALLOCATIONS , PICTURES , PAPER , WORKLOAD , GAIN , MODELS , PROCESSING , FORMULATIONS


Subject Categories : Computer Hardware


Distribution Statement : APPROVED FOR PUBLIC RELEASE