The already announced páper presents continuation of the serial of articles concerning the simple parallel scalable benchmark code. The new Pythagorean triples core has been implemented, tested and used for measurement. Several preliminary tests have shown suitability of the core routines for benchmark practice. The Pythagorean triples core extends functional properties of the scalable benchmark code, i.e. primes core functionality.
A group of six performance routines has been tested. Four Pythagorean triple generators/selectors have signifficant run time over the elapsed time window. The routines of significant run time have been taken into the final test of hardware performance. Performance routines are in generál of two types. Four routines generate numerical values by a mathematical formula. Two routines have been implemented selecting Pythagorean triples by means of testing the difference of squares of triangle side lengths.
Three hardware platforms have been tested: PC 486, an old type of Pentium, belongs to one of the first Pentium models of serial production (called here shortly archaic Pentium) and one of the highest performance Pentium 900 still used in the computational world for graphical animation.
This paper is intended to opeii a serial of articles concerning the development of the simple parallel scalable benchmark code. The prime algorithrns have been chosen as the hrst set of procedures in order to test in practice benchmarking ideas concerning the code properties. The prime routines were selected because of the simplicity of the problem formulation, an easy prograrnming eřfort as well as an extremely simple data operation. The code has been implemented as seven routines of significant performance. Four routines belong to nurnber generators and three procedures are prime selectors. Moreover two of the generators are single parametrical and the values of rernaining two procedures are generated by means of twoparametrical mathematical formula.
The performance of different generators/selectors are measured for benchmark size scaled according to powers of two. A single curve represents the functional behavior of the elapsed tirne of a selected routine on the benchmark size. The obtained performance curves of a couple of routines are collected into one figure. The single time window where a couple of curves is compared one to each other represents a substantial unit of the benchmark analysis of hardware facility.
The attention of the paper is concentrated on the benchmark code properties itself. The first paper of the seriál does not analyze any composition of hardware equipment or special hardware features. The code should finally be ušed to test capabilities of hardware facilities as well as to correlate software performance of practical packages with the performance characteristics of present code.
The developed and tested part of the scalable benchmark code, the
Pythagorean triples core, has been applied to the platform system of a scalable number of processors. The measurement has been performed on the system cluster consisting of 16 Pentium CPUs. The number of nodes of selected subclusters of an equivalent or a different performance of CPUs is scaled by the factor of 2. The core has been running in different conditions (homogeneous subcluster, heterogeneous subcluster, computationally free nodes and/or occupied nodes, etc.). A group of four measurements of the scalable number of processors has been selected and displayed in four characteristic blocks of the elapsed time Windows comparable with those of the previous paper. The characteristic exponential curves fit well to the measured points under the normal conditions of task run. The maximum deviations of the two exponential parameters in all presented cases do not exceed 5 percent.