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.