>On Wed, 8 Jul 1998, Stephen C. Tweedie wrote:
>> <H.H.vanRiel@phys.uu.nl> said:
>>
>> > When my zone allocator is finished, it'll be a piece of
>> > cake to implement lazy page reclamation.
>>
>> I've already got a working implementation. The issue of lazy
>> reclamation is pretty much independent of the allocator underneath; I
>> don't see it being at all hard to run the lazy reclamation stuff on
>top
>> of any form of zoned allocation.
>
>The problem with the current allocator is that it stores
>the pointers to available blocks in the blocks themselves.
>This means we can't wait till the last moment with lazy
>reclamation.
Presumably to reduce memory use, but at what cost? It prevents
lazy reclamation and makes locating available blocks a major
headache. It only takes 4k of memory to store a bitmap of free
blocks in a 128 Meg system. Storing the free list in free space is
an admirable hack, but maybe outdated.
Zach Amsden
amsden@andrew.cmu.edu
P.S. I'm new to this discussion, so please don't flay me if
everything I said is in gross violation of the truth.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu