Modeling the Communication Performance of the IBM SP2
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Parallelizing Merge Sort onto Distributed Memory Parallel Computers
ISHPC '02 Proceedings of the 4th International Symposium on High Performance Computing
The Skel-BSP Global Optimizer: Enhancing Performance Portability in Parallel Programming
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
High-Speed Image reconstruction based on CBP and Fourier Inversion Methods
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Simulation of Scientific Programs on Parallel Architectures with MIMESIS Environment
SS '96 Proceedings of the 29th Annual Simulation Symposium (SS '96)
Towards a more realistic BSP cost model
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Computational forces in the Linpack benchmark
Journal of Parallel and Distributed Computing
Computational forces in the SAGE benchmark
Journal of Parallel and Distributed Computing
Paper: Toward a better parallel performance metric
Parallel Computing
Aggregation AMG for distributed systems suffering from large message numbers
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Parallel LOD scheme for 3d parabolic problem with nonlocal boundary condition
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Modeling message-passing overhead on NCHC formosa PC cluster
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Computer performance analysis and the Pi Theorem
Computer Science - Research and Development
| Hi-index | 0.00 |
The strengths and weaknesses of the most commonly used benchmarks of supercomputer performance are compared (Livermore, Linpack, Perfect, SPEC and EuroBen). The theoretical peak performance is defined and compared with the realised performance on some of these benchmarks. The wide differences are interpreted in terms of terms of the performance parameters r"~, n"1"/"2, f"1"/"2, s"1"/"2, the latter three of which characterise the degradation of performance from inadequate vector length, inadequate computational intensity, and synchronisation overhead. The RINF, POLY benchmarks are defined for measuring these parameters. The PING-PONG benchmark is described for measuring the characteristics of communication in distributed systems, and the dangers associated with use of Speedup to compare the performance of algorithms on multiprocessor systems are discussed.