On 11/2/06, Alan D. Brunelle <[EMAIL PROTECTED]> wrote:
I've done some characterizations on how blkparse was running, and found that there is a significant memory usage problem. Falling back on an idea I had previously floated - a long, long time ago - I am proposing changing blkparse to utilize a simple merge sort. I'll be posting 4 cumulative patches -
Have you considered using Judy trees for improving the performance of blktrace/btt? On the homepage of Judy, there is an application note, that looks very much what blkparse/btt might need to do: http://judy.sourceforge.net/examples/work_load_analyzer.pdf Would the "features" of the Judy tree improve the performance of btt/blktrace? Best regards, Edwin - To unsubscribe from this list: send the line "unsubscribe linux-btrace" in the body of a message to [EMAIL PROTECTED] More majordomo info at http://vger.kernel.org/majordomo-info.html
