The NAS Parallel Benchmarks have been developed at NASA Ames Research Center to study the performance of parallel supercomputers. The eight benchmark problems are specified in a ‘‘pencil and paper ’’ fashion. In other words, the complete details of the problem to be solved are given in a technical document, and except for a few restrictions, benchmarkers are free to select the language constructs and implementation techniques best suited for a particular system. This paper presents performance results of various systems using the NAS Parallel Benchmarks. These results represent the best results that have been reported to us for the specific systems listed. 1. Subhash Saini is an employe of MRJ Inc. This work is supported by NASA Ames Research Center through contract NAS 2-14303. 2. David H. Bailey is an employee of NASA Ames Research Center .
[1]
Guy E. Blelloch,et al.
Radix sort for vector multiprocessors
,
1991,
Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).
[2]
David H. Bailey,et al.
Performance results for two of the NAS parallel benchmarks
,
1991,
Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).
[3]
Leonardo Dagum.
Parallel Integer Sorting with Medium and Fine-Scale Parallelism
,
1993,
Int. J. High Speed Comput..
[4]
J. G. Lewis,et al.
Distributed memory matrix-vector multiplication and conjugate gradient algorithms
,
1993,
Supercomputing '93.