New G2 HP Prime

[CyberAngel]

(08-30-2018 10:56 PM)Anders Wrote:  

(08-30-2018 10:02 PM)Claudio L. Wrote:  If you look at Xerxes's list, you'll see he has done this test on hundreds of machines, so right now is not the time to change the testing pattern. Every other implementation (I think) was tested with all the overhead to solve one problem. If you need to run that multiple times, you run it in a loop, and measure outside the loop, then divide by the number of executions.
Moving what you call "prep work" out of the loop makes your result not comparable to all other measurements in the list.

Yes and you can be sure that I understand that. However,
1. the code is different for every platform, (since they use different languages to implement the same basic algorithm)
2. therefore the implementation is different for every platform (allowing for optimizations)
3. it's not clear how each benchmark was measured and how many times in each test

In other words it is already difficult to compare platforms without understanding this.

If x0% of the time in a benchmark running one loop is due to malloc's or what other stuff the OS is doing just to set up the process/tread of the program before it executes the main algorithm, are we measuring what we want to measure? (speed at which it solves a problem executing a particular algorithm - which is the same on all platforms). I think not.

The timing should be looped algorithm per second.
If the measurement is done by a human
then a suitable long long time should limit the error involved.
Timing a minute and forty seconds or 100_s is too error prone.
I'd say 16_min 40_s or 1000_s (a kilosecond) would do it.
Unfortunately if some old machine runs the algorithm ONCE in over 3_h
then it's about 0.083 algorithm/s?

How much time it takes for a Ferris wheel to turn one round?
How about a turbine engine?
We use revolutions per minute for car engines.

MIPS = Million Instructions Per Second
That's what we should use for calculators.

Just my flow of thoughts at about 3:30 AM (I woke up)