Re: Regular gcc benchmark runs for sparse-matrix vector multiplication?

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



On Mon, Dec 17, 2018 at 8:34 AM Thomas Koenig <tkoenig@xxxxxxxxxxxxx> wrote:
>
> Hi Harald,
>
> > If there's interest, I can create a bugzilla with test program
> > and test data.
>
> Please do.
>
> In an ideal world, people would use always use bounds checking,
> with almost zero overhead.  This is not realistic, but we should
> not regress on our way there :-)

GCC 9 IL looks saner than the GCC 7/8 one.  Note both compilers
have bound checks inside the innermost loop.  The main difference
seems to be in loop header copying where GCC 9 is behaving
much "better" IMHO.  It would be interesting to see whether
-fno-tree-ch brings results of the compilers in-line again (even
if it causes the code to run even more slow).

Richard.

> Regards
>
>         Thomas



[Index of Archives]     [Linux C Programming]     [Linux Kernel]     [eCos]     [Fedora Development]     [Fedora Announce]     [Autoconf]     [The DWARVES Debugging Tools]     [Yosemite Campsites]     [Yosemite News]     [Linux GCC]

  Powered by Linux