lkml.org 
[lkml]   [2002]   [May]   [2]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
From
SubjectRe: discontiguous memory platforms
Date
On Thursday 02 May 2002 19:56, Roman Zippel wrote:
> Daniel Phillips wrote:
>
> > Maybe this is a good place to try out a hash table variant of
> > config_nonlinear. It's got to be more efficient than searching all the
> > nodes, don't you think?
>
> Most of the time there are only a few nodes, I just don't know where and
> how big they are, so I don't think a hash based approach will be a lot
> faster. When I'm going to change this, I'd rather try the dynamic table
> approach.

Which dynamic table approach is that?

--
Daniel
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 13:25    [W:0.109 / U:2.488 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site