Messages in this thread | | | Date | Sat, 27 Mar 1999 17:00:53 +0100 (MET) | From | Gerard Roudier <> | Subject | Re: buffer cache behavior on memory-constrained systems (fwd) |
| |
Andrea,
On Sat, 27 Mar 1999, Andrea Arcangeli wrote:
[ ... ]
> Note that in ftp://e-mind.com/pub/linux/andrea-tree/2.2.4_andrea3.bz2 I am > just freeing pages in shrink_mmap() in perfect lru basis (taking care also > of buffer aging). But I am doing it at the pagemap level. I see it far > more clean and general. I am touching the buffer not in bread but in > get_hash_table and in getblk if the buffer is not found in the hash table. > > Performances are impressive here. I can checkin a whole linux CVS tree in > 2sec. Having a perfect lru rocks.
I didn't try your shrink_mmap enhancement for the moment, but just reading you, it looks great. I will have a look at it and give it a try when I will have time for, may-be to-morrow, and let you know if I have some comments.
By the way, it seems that there are some other O/Ses that still use the clock algorithm and donnot perform that bad. Anyway, just thinking of system with large amount of memory really used disqualified the clock algorithm against a simple LRU, in my opinion.
Gérard.
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/
| |