lkml.org 
[lkml]   [2011]   [Sep]   [23]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
From
SubjectRe: BFS cpu scheduler and skip list implementation
Date
On Sat, 24 Sep 2011 11:21:06 Andi Kleen wrote:
> Con Kolivas <kernel@kolivas.org> writes:
> > +struct nodeStructure {
> > + int level; /* Levels in this structure */
> > + keyType key;
> > + valueType value;
> > + skiplist_node *next[16];
> > + skiplist_node *prev[16];
> > +};
>
> That's 128 byte / 2 cache lines, not too bad, but it limits
> the maximum number of tasks that can be efficiently handled
> (my guess to around 64k with maxlevel == 16, but someone may
> correct me on that)

Thanks very much for your informed comments. Do you mean once 64k of tasks are
queued concurrently, or after 64k of entries have gone in +/- been removed?

Con

--
-ck


\
 
 \ /
  Last update: 2011-09-24 04:17    [from the cache]
©2003-2014 Jasper Spaans. Advertise on this site