[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [PATCH 2/2] Rewrite gsync so that it works with remote tasks v2
From: |
Samuel Thibault |
Subject: |
Re: [PATCH 2/2] Rewrite gsync so that it works with remote tasks v2 |
Date: |
Sat, 4 Mar 2017 23:00:03 +0100 |
User-agent: |
NeoMutt/20170113 (1.7.2) |
Samuel Thibault, on sam. 04 mars 2017 22:54:39 +0100, wrote:
> Samuel Thibault, on sam. 04 mars 2017 22:45:08 +0100, wrote:
> > Agustina Arzille, on mer. 01 févr. 2017 12:32:53 -0300, wrote:
> > > /* Look for a key that matches. We take advantage of the fact
> > > * that the entries are sorted to break out of the loop as
> > > * early as possible. */
> >
> > Do we really want to keep that list sorted? That makes waking up two
> > times less expensive, but it makes waiting much more expensive, so
> > overall it's just the same.
>
> There is the broadcast case which would then have to go through the
> whole list instead of half of the list in average. I'd however tend to
> prefer to optimize the non-broadcast case over the broadcast case, since
> broadcasts are rare.
Ah, there is also the splicing done in requeue. Is that a common
scenario? I don't see it used within glibc, for instance.
Samuel