NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
Scalable problems and memory bounded speedupIn 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.
Document ID
19930007365
Acquisition Source
Legacy CDMS
Document Type
Preprint (Draft being sent to journal)
Authors
Sun, Xian-He (Institute for Computer Applications in Science and Engineering Hampton, VA, United States)
Ni, Lionel M. (Institute for Computer Applications in Science and Engineering Hampton, VA, United States)
Date Acquired
September 6, 2013
Publication Date
November 1, 1992
Subject Category
Mathematical And Computer Sciences (General)
Report/Patent Number
NASA-CR-189726
NAS 1.26:189726
ICASE-92-59
AD-A259227
Accession Number
93N16554
Funding Number(s)
CONTRACT_GRANT: NAS1-19480
CONTRACT_GRANT: NSF ECS-88-14207
PROJECT: RTOP 505-90-52-01
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Related Records

There are no records associated with this record.
No Preview Available