Difference: FloatingPointUnit (37 vs. 38)

Revision 382022-11-20 - PeterSchmid

Line: 1 to 1

META TOPICPARENT	name="WebHome"

%DASHBOARD{ section="banner"

Line: 411 to 411

Cycles 5

Changed:

<
< Swift-Forth on a 64 bit Windows PC @ 3.4 GHz, HW FPU

>
> Swift-Forth on a 64 bit Windows PC @ 3.4 GHz, HW FPU

: test ( --  ) \ test 1'000 times sin, displays time in us
  ucounter cr
  pi 2e f* 1000e f/  \ 2*pi/1000
  cr
  1000 0 do

Changed:

<
< fdup i s>f f* fdrop \ fdup i s>f f* fsin fdrop

>
> \ fdup i s>f f* fdrop fdup i s>f f* fsin fdrop

\ i . fdup i s>f f* fsin fs. cr \ i . fdup i s>f f* fsin hex. hex. cr loop

Line: 429 to 429

91 us, 28 us -> 63 ns for fsin. 2 magnitudes faster than Mecrisp-Cube M4F @ 32 MHz

Added:

>
>

Gforth on a 64 bit Linux PC @ Intel I7 8 cores 2.2 GHz, HW FPU

: test ( --  ) \ test 1'000 times sin, displays time in us
  utime cr
  pi 2e f* 1000e f/  \ 2*pi/1000
  cr
  1000 0 do
\    fdup i s>f f*      fdrop
     fdup i s>f f* fsin fdrop
\    i .  fdup i s>f f* fsin fs.   cr
\    i .  fdup i s>f f* fsin hex. hex.  cr
  loop
  fdrop
  utime 2swap d-
;

64 us, 13 us -> 51 ns for fsin. 2 magnitudes faster than Mecrisp-Cube M4F @ 32 MHz

Conclusion

As long as you do only elementary arithmetic, fixed- and floating-point have comparable execution time (but division and multiplication is a magnitude slower). But for more elaborate calculation (trigonomteric, exponential functions) the execution time is for fixed-point at least two magnitudes slower.

View topic | History: r44 < r43 < r42 < r41 | More topic actions...