I'm suffering from memory fragmentation slow downs, and my machine
just has to be up for a while before memory gets sufficiently
fragmented to cause trouble :(
Anyone want to explain to me really slowly why we try to keep huge
chunks of contiguous memory?
And why if that is important why we don't implement a relocating
defragmentation algorithm in the kernel? On the assumption that I
could pause the kernel for a moment, it would be probably faster to do
that on demand, then the current mess!
There is a defragmentation algorithm that runs in O(mem_size) time
with two passes over memory, and needs no extra memory.
Of course that requires enough information about the allocated blocks
to find their pointers. Or basically the same amount of type
information that garbage collection requires.
Eric
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.rutgers.edu