An analytical model of the HINT performance metric
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Architectural and application: the performance of the NEC SX-4 on the NCAR benchmark suite
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Object Placement Using Performance Surfaces
Cluster Computing
Performance Surface Prediction for WAN-Based Clusters
The Journal of Supercomputing
Conventional Benchmarks as a Sample of the Performance Spectrum
The Journal of Supercomputing
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
The DOGMA approach to parallel and distributed computing
Cluster computing
International Journal of High Performance Computing Applications
Simulation of Computer Architectures: Simulators, Benchmarks, Methodologies, and Recommendations
IEEE Transactions on Computers
Software—Practice & Experience
Finding representative workloads for computer system design
Finding representative workloads for computer system design
A cost model for distributed coverage processing services
Proceedings of the ACM SIGSPATIAL International Workshop on High Performance and Distributed Geographic Information Systems
PAS2P tool, parallel application signature for performance prediction
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume Part I
| Hi-index | 0.00 |
The computing community has long faced the problem of scientifically comparing different computers and different algorithms. When architectures, methods, precision, or storage capacity are very different it is difficult or misleading to compare speeds using the ratio of execution times. We present a practical and fair approach that provides mathematically sound comparison of computational performance even when the algorithm, computer, and precision are changed. HINT (Hierarchical INTegration) removes the need for pseudo-work measures such as MFLOPS or MIPS, producing a work measure we call QUIPS (quality improvements per second). It reveals memory bandwidth and memory regimes, and runs on any memory size. The scalability of HINT allows it to compare computing as slow as hand calculation to computing as fast as the largest supercomputers. It ports to every sequential and parallel programming environment with very little effort, permitting fair but low-cost comparison of any architecture capable of digital arithmetic.