Dynamic storage allocation (DSA) from the fragmentation perspective.
DSA is as important for programming as control flow statements. Yet we keep ignoring the fact that it is not understood--see Wilson et al's "DSA: A Survey and Critical Review" for one of the best problem statements of all time.
Fragmentation is DSA's (and every Tetris player's) main enemy. Believe it or not, we haven't managed to converge on how to measure it yet.
I am working on a tool that a) computes an approximately optimal fragmentation value per application and b) also computes fragmentation for arbitrary app/allocator pairs.
DSA is as important for programming as control flow statements. Yet we keep ignoring the fact that it is not understood--see Wilson et al's "DSA: A Survey and Critical Review" for one of the best problem statements of all time.
Fragmentation is DSA's (and every Tetris player's) main enemy. Believe it or not, we haven't managed to converge on how to measure it yet.
I am working on a tool that a) computes an approximately optimal fragmentation value per application and b) also computes fragmentation for arbitrary app/allocator pairs.