lmi
[Top][All Lists]
Advanced

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

Re: [lmi] [lmi-commits] master f1ec209 1/9: Demonstrate that PETE has a


From: Vadim Zeitlin
Subject: Re: [lmi] [lmi-commits] master f1ec209 1/9: Demonstrate that PETE has a non-zero overhead
Date: Sun, 4 Apr 2021 13:30:47 +0200

On Sun,  4 Apr 2021 07:00:19 -0400 (EDT) Greg Chicares 
<gchicares@sbcglobal.net> wrote:

GC> branch: master
GC> commit f1ec2099b587c101b95a3062ac2601acf77e7af0
GC> Author: Gregory W. Chicares <gchicares@sbcglobal.net>
GC> Commit: Gregory W. Chicares <gchicares@sbcglobal.net>
GC> 
GC>     Demonstrate that PETE has a non-zero overhead
GC>     
GC>     For each_equal(), it's about half as fast as plain C++.

 This seems amazingly poor, but I guess the vectors here might be small
enough that there is a non-negligible overhead from just the extra
functions calls involved when using PETE?

 I guess it's not worth looking into this further, as you would have
probably indicated if it were, but I didn't expect the abstraction penalty
to be so high here.

 Regards,
VZ

Attachment: pgpveqXg5aI0G.pgp
Description: PGP signature


reply via email to

[Prev in Thread] Current Thread [Next in Thread]