Re: No 100 HZ timer!

george anzinger
2001-04-13T16:09:07Z

Jamie Lokier wrote:
>
> george anzinger wrote:
> > > Wouldn't a heap be a good data structure for a list of timers? Insertion
> > > is log(n) and finding the one with the least time is O(1), ie pop off the
> > > front.... It can be implemented in an array which should help cache
> > > coherency and all those other things they talked about in school :)
> > >
> > I must be missing something here. You get log(n) from what? B-trees?
> > How would you manage them to get the needed balance? Stopping the world
> > to re-balance is worse than the cascade. I guess I need to read up on
> > this stuff. A good pointer would be much appreciated.
>
> Look for "priority queues" and "heaps". In its simplest form, you use a
> heap-ordered tree, which can be implemented using an array (that's
> usually how it's presented), or having the objects in the heap point to
> each other.
>
> A heap-ordered tree is not as strictly ordered as, well, an ordered tree
> :-) The rule is: if A is the parent of B and C, then A expires earlier
> than B, and A expires earlier than C. There is no constraint on the
> relative expiry times of B and C.
>
> There is no "stop the world" to rebalance, which you may consider an
> advantage over the present hierarchy of tables. On the other hand, each
> insertion or deletion operation takes O(log n) time, where n is the
> number of items in the queue. Although fairly fast, this bound can be
> improved if you know the typical insertion/deletion patterns, to O(1)
> for selected cases. Also you should know that not all priority queues
> are based on heap-ordered trees.
>
> Linux' current hierarchy of tables is a good example of optimisation: it
> is optimised for inserting and actually running short term timers, as
> well as inserting and deleting (before running) long term timers. These
> extremes take O(1) for insertion, removal and expiry, including the
> "stop the world" time. This should be considered before and move to a
> heap-based priority queue, which may turn out slower.
>
> > Meanwhile, I keep thinking of a simple doubly linked list in time
> > order. To speed it up keep an array of pointers to the first N whole
> > jiffie points and maybe pointers to coarser points beyond the first N.
> > Make N, say 512. Build the pointers as needed. This should give
> > something like O(n/N) insertion and O(1) removal.
>
> You've just described the same as the current implementation, but with
> lists for longer term timers. I.e. slower. With your coarser points,
> you have to sort the front elements of the coarse list into a fine one
> from time to time.
>
> The idea of having jiffie-point pointers into a data structure for fast
> insertion is a good one for speeding up any data structure for that
> common case, though.
>
If we are to do high-res-timers, I think we will always have to do some
sort of a sort on insert. If we can keep the sort to a VERY short list
and only do it on sub jiffie timers, we will have something that is VERY
close to what we have now.

I think that the density of timers tends to increase as they get closer
to "now". This should allow coarser pointers for times more removed
from "now". Still if we sort on insert we will not have to resort
later.

The pointers into the list, however, are perishable and need to be
refreshed as time passes. My though was to do this only when a needed
pointer was found to be "expired" and then only for the needed pointer.
On first need we would have a small overhead, but would remember for
next time.

Thanks for the good input

George