论文信息 - How to measure, present, and compare parallel performance

How to measure, present, and compare parallel performance

Presentations of parallel performance can be easily and unintentionally distorted. Following some simple guidelines for measuring, presenting and comparing performance can greatly improve your presentation's accuracy and effectiveness.<<ETX>>

Lawrence A. Crowl

[1] David H. Bailey. Misleading performance in the supercomputing field , 1992, Proceedings Supercomputing '92.

[2] Lionel M. Ni,et al. Scalable Problems and Memory-Bounded Speedup , 1993, J. Parallel Distributed Comput..

[3] Robert E. Benner,et al. Development of Parallel Methods for a $1024$-Processor Hypercube , 1988 .

[4] Martin H. Schultz,et al. Efficient parallel programming with Linda , 1992, Proceedings Supercomputing '92.

[5] Anoop Gupta,et al. Scaling parallel programs for multiprocessors: methodology and examples , 1993, Computer.

[6] Lawrence A. Crowl. Architectural adaptability in parallel programming , 1991 .

[7] Stephen G. Nash,et al. Guidelines for reporting results of computational experiments. Report of the ad hoc committee , 1991, Math. Program..

[8] Richard S. Barr,et al. On Reporting the Speedup of Parallel Algorithms: a Survey of Issues and Experts , 1992, Computer Science and Operations Research.

[9] Vance Faber,et al. Comments on the paper "parallel efficiency can be greater than unity" , 1987, Parallel Comput..

[10] G. R. Withers,et al. Computing performance as a function of the speed, quantity, and cost of the processors , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).