Benchmarking the Connection Machine. Final report
Technical Report
·
OSTI ID:5749261
Performance of various computers is compared by running programs across different machines and comparing execution times (benchmarking the computers). Scientific or engineering benchmarks are usually measured in Mflops (millions of floating point operations per second). The current state of benchmarking supercomputer architectures is not very clear. Performances of a specific supercomputer on various benchmarks may vary greatly, making the judgment extremely difficult. Naturally, certain benchmarks may be more suited to a particular machine's architecture. Running standard benchmarks, without modification, across various supercomputers can show the effectiveness of the compilers in using the available resources. The allows comparison with an optimized code implementation. This paper presents the results of benchmarking the Connection Machine CM-2 a (a parallel processor) with an efficient, highly parallel implementation of the Livermore Loops. Re-coded in CM Fortran, only a few of the kernels required significant modification. The loops have been one of the most often run benchmark suites and form a good testbed for parallel machines due to the many varied computational structures. Analysis and discussion of the single and double precision Mflop rates are presented for large vector lengths on a 32K CM-2. For applications involving large vector lengths, a large amount of computation, and minimal general communication the CM-2 performs extremely well. Gigaflop performance was attained on the computationally intensive kernels.
- Research Organization:
- Naval Research Lab., Washington, DC (USA)
- OSTI ID:
- 5749261
- Report Number(s):
- AD-A-229705/9/XAB; NRL--9289
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficiently modeling neural networks on massively parallel computers
Efficiently modeling neural networks on massively parallel computers
An efficient parallel algorithm for matrix-vector multiplication
Conference
·
Tue Dec 31 23:00:00 EST 1991
·
OSTI ID:6964551
Efficiently modeling neural networks on massively parallel computers
Conference
·
Mon Nov 30 23:00:00 EST 1992
·
OSTI ID:10111975
An efficient parallel algorithm for matrix-vector multiplication
Technical Report
·
Sun Feb 28 23:00:00 EST 1993
·
OSTI ID:10161929
Related Subjects
99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
COMPILED DATA
COMPUTER ARCHITECTURE
COMPUTERS
DATA
DIGITAL COMPUTERS
DIMENSIONS
DOCUMENT TYPES
ENGINEERING
FORTRAN
IMPLEMENTATION
INFORMATION
LENGTH
NUMERICAL DATA
OPTIMIZATION
PARALLEL PROCESSING
PERFORMANCE TESTING
PROGRAMMING
PROGRAMMING LANGUAGES
PROGRESS REPORT
RESOURCES
STANDARDS
SUPERCOMPUTERS
TESTING
VECTOR PROCESSING
990200* -- Mathematics & Computers
COMPILED DATA
COMPUTER ARCHITECTURE
COMPUTERS
DATA
DIGITAL COMPUTERS
DIMENSIONS
DOCUMENT TYPES
ENGINEERING
FORTRAN
IMPLEMENTATION
INFORMATION
LENGTH
NUMERICAL DATA
OPTIMIZATION
PARALLEL PROCESSING
PERFORMANCE TESTING
PROGRAMMING
PROGRAMMING LANGUAGES
PROGRESS REPORT
RESOURCES
STANDARDS
SUPERCOMPUTERS
TESTING
VECTOR PROCESSING