>> But more important you could have the first entry in the lru list not
>> freeable (don't ask me why ;), and in such case you would have big
>> stability problems.
>
>in which case you'd probably see some "out of memory" errors.
Yes, exactly.
>> 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.
>
>nice work, andrea...
Many thanks ;)).
>i've only tried this patch for a short time, but it seems to exhibit lots
>of desirable characteristics when memory becomes constrained. i'll take a
I am working still more on it. I had some further idea I am implementing
now. Maybe the next patch will be still better.
Andrea Arcangeli
-
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/