Fat-trees: universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers
Parallel efficiency can be greater than unity
Parallel Computing
Communications of the ACM
Distributed orthogonal factorization: givens and householder algorithms
SIAM Journal on Scientific and Statistical Computing
The design of a scalable, fixed-time computer benchmark
Journal of Parallel and Distributed Computing
Scalable problems and memory-bounded speedup
Journal of Parallel and Distributed Computing
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Solving Linear Systems on Vector and Shared Memory Computers
Solving Linear Systems on Vector and Shared Memory Computers
Isoefficiency: Measuring the Scalability of Parallel Algorithms and Architectures
IEEE Parallel & Distributed Technology: Systems & Technology
Modeling Speedup (n) Greater than n
IEEE Transactions on Parallel and Distributed Systems
Scalability of Parallel Algorithm-Machine Combinations
IEEE Transactions on Parallel and Distributed Systems
Performance prediction of scalable computing: a case study
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Integrated Range Comparison for Data-Parallel Compilation Systems
IEEE Transactions on Parallel and Distributed Systems
Evaluating the Scalability of Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Scalability versus execution time in scalable systems
Journal of Parallel and Distributed Computing
Performance Prediction: A Case Study Using a Scalable Shared-Virtual-Memory Machine
IEEE Parallel & Distributed Technology: Systems & Technology
The Relation of Scalability and Execution Time
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Average-Case Scalability Analysis of Parallel Computations on k-ary d-cubes
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IEEE Transactions on Parallel and Distributed Systems
The Journal of Supercomputing
| Hi-index | 0.00 |
Generalized speedup is defined as parallel speed over sequential speed. In this paper the generalized speedup and its relation with other existing performance metrics, such as traditional speedup, efficiency, scalability, etc., are carefully studied. In terms of the introduced asymptotic speed, we show that the difference between the generalized speedup and the traditional speedup lies in the definition of the efficiency of uniprocessor processing, which is a very important issue in shared virtual memory machines. A scientific application has been implemented on a KSR-1 parallel computer. Experimental and theoretical results show that the generalized speedup is distinct from the traditional speedup and provides a more reasonable measurement. In the study of different speedups, an interesting relation between fixed-time and memory-bounded speedup is revealed. Various causes of superlinear speedup are also presented.