lkml.org 
[lkml]   [2002]   [Jan]   [31]   [last100]   RSS Feed
Views: [more markup]  [less markup]  [headers]  [forward] 
 
Messages in this thread
/
DateThu, 31 Jan 2002 11:58:10 -0200 (BRST)
FromRik van Riel <>
SubjectRe: [PATCH] Radix-tree pagecache for 2.5
On Thu, 31 Jan 2002, Andrea Arcangeli wrote:

> So I wouldn't merge it, at least until some math is done for the memory
> consumation with 500k inodes with only 1 page in them each, and on the
> number of heights/levels that must be walked during the tree lookup,
> during a access at offset 10G (or worst case in general [biggest
> height]) of an inode with 10G just allocated in pagecache.

Ummm, I don't see how this worst case is any more realistic
as the worst case for the hash table (where all pages live
in very few hash buckets and we have really deep chains).

People just don't go around caching a single page each for
all of their 10 GB files and even if they _wanted to_ they
couldn't because of the readahead code.

I suspect that for large files we'll always have around
min_readahead logically contiguous pages cached, if not more.

regards,

Rik
-- 
"Linux holds advantages over the single-vendor commercial OS"
    -- Microsoft's "Competing with Linux" document

http://www.surriel.com/		http://distro.conectiva.com/

-
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 12:16    [W:0.370 / U:0.290 seconds]
©2003-2008 Jasper Spaans