The genesis distributed memory benchmarks. Part 2: COMMS1, TRANS1, FFT1 and QCD2 benchmarks on the suprenum and IPSC/860 computers

Hey, A J G; Hockney, Roger W.; Getov, Vladimir; Wolton, I.C.; Merlin, John H.; Allwright, James

doi:10.1002/cpe.4330070603

Cited by 4 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Data rate, or bandwidth, is calculated from the number of bytes sent divided by half the round-trip time. A number of other similar tests have been reported in [7,8].…”

Section: Measurement Methodologymentioning

confidence: 67%

Message-passing performance of various computers

Dongarra

Dunigan

1997

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

This report compares the performance of different computer systems for basic message passing. Latency and bandwidth are measured on Convex, Cray, IBM, Intel, KSR, Meiko, nCUBE, NEC, SGI and TMC multiprocessors. Communication performance is contrasted with the computational power of each system. The comparison includes both shared and distributed memory computers as well as networked workstation clusters. © 1997 John Wiley & Sons, Ltd.

show abstract

“…Data rate, or bandwidth, is calculated from the number of bytes sent divided by half the round-trip time. A number of other similar tests have been reported in [7,8].…”

Section: Measurement Methodologymentioning

confidence: 67%

Message-passing performance of various computers

Dongarra

Dunigan

1997

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

show abstract

“…All other parameters can be substituted by their measured or estimated values for the target machine. The examples given below are based on the FFT1 benchmark from the GENESIS suite [8,9]. This benchmark follows the classical vectorised implementation of the 1-dimensional FFT algorithm [2].…”

Section: Examples On Ipsc/860mentioning

confidence: 99%

Benchmarking the cache memory effect

Getov

1996

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A new performance model of the memory hierarchy is first introduced, which describes all possible scenarios for the calculation process, including the important case when the cache memory is bypassed. A detailed study of each scenario is then given along with the derivation of corresponding formulae. In these formulae the cache load time associated with the penalty which must be paid to transfer data between the main memory and the cache is also taken into account. A two-parameter linear model for performance characterisation of cache memory effect is introduced. The double-performance parameter, n2, is defined to describe the performance degradation for problem sizes that do not fit into the cache memory. This parameter determines the problem size required to preserve twice the asymptotic performance. Excellent agreement is shown between the estimated performance figures and several benchmark measurements on iPSC/860. * The results presented here were previously published in an extended version of this article which appeared in Supercomputer 63, vol XI (5), 1995. They are re-produced with kind permission of ASFRA BV, The Netherlands.

show abstract

Computational similarity

Hockney¹

1995

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

SUMMARYThe paper enunciates the principle of computational similarity, whereby calculations with the same values for certain dimensionless ratios are said to be 'computationally similar' and as a consequence have the same optimum self-speed-up and optimum number of processors. Based on a three-parameter description of the computer hardware, two dimensionless ratios, which are only a function of the problem size and the hardware parameters, completely determine the scaling. Contours of constant self-speed-up can be drawn on a two-dimensional dimensionless universal scaling diagram (DUSD). This diagram is for a particular class of timing expressions that can be shown to represent approximately the performance of a corresponding class of computer programs or benchmarks, but it applies to all computers describable by the three hardware parameters and to all problem sizes. Thus the dimensionless ratios play a similar role in the study of computer performance, as do the Reynolds and other dimensionless numbers in fluid dynamics. This dimensional analysis of computer performance is illustrated by the case of the FFTl benchmark from the Southampton 'Genesis' distributed-memory benchmarks.

show abstract

The genesis distributed memory benchmarks. Part 2: COMMS1, TRANS1, FFT1 and QCD2 benchmarks on the suprenum and IPSC/860 computers

Cited by 4 publications

References 19 publications

Message-passing performance of various computers

Message-passing performance of various computers

Benchmarking the cache memory effect

Computational similarity

Contact Info

Product

Resources

About