ACM Transactions on Computer Systems (TOCS)
ACM Computing Surveys (CSUR)
Communications of the ACM
Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications
IEEE Transactions on Computers
Speedup Versus Efficiency in Parallel Systems
IEEE Transactions on Computers
Characterizations of parallelism in applications and their use in scheduling
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Computing performance as a function of the speed, quantity, and cost of the processors
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Measuring parallel processor performance
Communications of the ACM
Analysis of scalability of parallel algorithms and architectures: a survey
ICS '91 Proceedings of the 5th international conference on Supercomputing
A bibliography of parallel debuggers, 1993 edition
PADD '93 Proceedings of the 1993 ACM/ONR workshop on Parallel and distributed debugging
Distributed computing feasibility in a non-dedicated homogeneous distributed system
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
On the Scalability of 2-D Discrete Wavelet Transform Algorithms
Multidimensional Systems and Signal Processing
Isoefficiency: Measuring the Scalability of Parallel Algorithms and Architectures
IEEE Parallel & Distributed Technology: Systems & Technology
Scalability of Parallel Algorithm-Machine Combinations
IEEE Transactions on Parallel and Distributed Systems
Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules
IEEE Transactions on Parallel and Distributed Systems
Extending Amdahl's law in the multicore era
ACM SIGMETRICS Performance Evaluation Review
Reevaluating Amdahl's law in the multicore era
Journal of Parallel and Distributed Computing
Paper: Toward a better parallel performance metric
Parallel Computing
A novel fault-tolerant parallel algorithm
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
What Hill-Marty model learn from and break through Amdahl's law?
Information Processing Letters
Memory access cycle and the measurement of memory systems
Proceedings of the second international workshop on Performance modeling, benchmarking and simulation of high performance computing systems
Amdahl's law for predicting the future of multicores considered harmful
ACM SIGARCH Computer Architecture News
APC: a performance metric of memory systems
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
In this paper three models of parallel speedup are studied. They are fixed-size speedup, fixed-time speedup and memory-bounded speedup. Two sets of speedup formulations are derived for these three models. One set requires more information and gives more accurate estimation. Another set considers a simplified case and provides a clear picture of possible performance gain of 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 its special cases. This study proposes a new metric for performance evaluation and leads to a better understanding of parallel processing.