DocumentCode :
1263457
Title :
Modelling speedup (n) greater than n
Author :
Helmbold, David P. ; McDowell, Charles E.
Author_Institution :
Board of Studies in Comput. & Inf. Sci., California Univ., Santa Cruz, CA, USA
Volume :
1
Issue :
2
fYear :
1990
fDate :
4/1/1990 12:00:00 AM
Firstpage :
250
Lastpage :
256
Abstract :
A simple model of parallel computation which is capable of explaining speedups greater than n on n processors is presented. Necessary and sufficient conditions for these exceptional speedups are derived from the model. Several of the contradictory previous results relating to parallel speedup are resolved by using the model
Keywords :
parallel algorithms; parallel machines; parallel programming; performance evaluation; programming theory; parallel computation; speedups; superlinearity; superunity; Analytical models; Parallel algorithms; Processor scheduling; Registers; Sufficient conditions;
fLanguage :
English
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
1045-9219
Type :
jour
DOI :
10.1109/71.80148
Filename :
80148
Link To Document :
بازگشت