Multiplying the number of processors by the clock speed of the processors, and then multiplying that product by the number of floating-point operations the processors can perform in one second, as done for supercomputers FLOPS, does not help me :-)
Multiplying the number of processors by the clock speed of the processors, and then multiplying that product by the number of floating-point operations the processors can perform in one second, as done for supercomputers FLOPS, does not help me :-)
And why should your algorithm be the benchmark for supercomputer performance, rather than something that is at least somewhat related [1] to the workloads those machines run?
[1] We can of course argue endlessly that HPL is no longer a very representative benchmark for supercomputer workloads, but I digress.
Nobody but you is confused about this.
I was trolling a little bit, the people who downvoted my measure of speed :-) because the millions of FLOPS of a supercomputer, will help for parallel tasks but will not be "faster" for a common use case.
So fastest computer is one thing, most powerful is another.
Your argument is a bit like saying the fastest land speed vehicle isn't really the fastest because you can't go to the grocery store with it.