[lkml]   [1998]   [Sep]   [19]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: AVL and hash in memory management
   Date: Sat, 19 Sep 1998 11:49:31 +0200
From: Martin Mares <>

> Research work shows that only at around 1000 entires does the lookup
> speed make up for the balancing cost of a tree.

Was this research done for the Linux VMA case or for some "average" access
patterns used by the database folks? The latter would be of little use since
in most cases we have more finds than inserts/deletes (*much* more on a i386
where we need it for access_ok()).

Two of the sample cases (amongst others) were Linux VMA and Schoebel's
new I/O layer subsystem. The others were scattered over various other
applications such as routing table lookups etc.

David S. Miller

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
Please read the FAQ at

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