If this turns out to be the problem then please file a JIRA for it. That
code is some of the oldest code in proton and there has been a nice
efficient circular buffer implementation available in the codebase for ages
now.
--Rafael
On Mon, Oct 27, 2014 at 1:35 PM, Gordon Sim wrote:
> On 10/27/20
On 10/27/2014 04:39 PM, Bozo Dragojevic wrote:
On 27. 10. 14 13:16, Michael Goulish wrote:
You know, I thought of something along those lines, but I can't
see how it makes the receiver actually use less CPU permanently.
It seems like it ought to simply get a backlog, but go back
to normal CPU us
On 27. 10. 14 13:16, Michael Goulish wrote:
> You know, I thought of something along those lines, but I can't
> see how it makes the receiver actually use less CPU permanently.
> It seems like it ought to simply get a backlog, but go back
> to normal CPU usage.
My guess is that sender creates for
You know, I thought of something along those lines, but I can't
see how it makes the receiver actually use less CPU permanently.
It seems like it ought to simply get a backlog, but go back
to normal CPU usage.
Can you think of any way that a backlog would cause receiver to
stay at low CPU?
Now
On 27. 10. 14 09:10, Michael Goulish wrote:
> Earlier I reported a very gradual slowdown in the performance
> of my simple 1-sender 1-receiver test, on RHEL 7.0 and Fedora 20
> but not on RHEL 6.3 .
>
> The slowdown caused the test to end up running at half speed after
> a billion or two billion
