From mboxrd@z Thu Jan 1 00:00:00 1970 Date: Wed, 12 Jan 2005 23:03:14 -0800 From: Matt Mackall Subject: Re: [RFC] Avoiding fragmentation through different allocator Message-ID: <20050113070314.GL2995@waste.org> References: Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: Sender: owner-linux-mm@kvack.org Return-Path: To: Mel Gorman Cc: Linux Memory Management List , Linux Kernel Mailing List List-ID: On Wed, Jan 12, 2005 at 09:09:24PM +0000, Mel Gorman wrote: > I stress-tested this patch very heavily and it never oopsed so I am > confident of it's stability, so what is left is to look at the results of > this patch were and I think they look promising in a number of respects. I > have graphs that do not translate to text very well, so I'll just point you > to http://www.csn.ul.ie/~mel/projects/mbuddy-results-1 instead. This graph rather hard to comprehend. > The results were not spectacular but still very interesting. Under heavy > stresing (updatedb + 4 simultaneous -j4 kernel compiles with avg load 15) > fragmentation is consistently lower than the standard allocator. It could > also be a lot better if there was some means of purging caches, userpages > and buffers but thats in the future. For the moment, the only real control > I had was the buffer pages. You might stress higher order page allocation with a) 8k stacks turned on b) UDP NFS with large read/write. > Opinions/Feedback? Looks interesting. -- Mathematics is the supreme nostalgia of our time. -- To unsubscribe, send a message with 'unsubscribe linux-mm' in the body to majordomo@kvack.org. For more info on Linux MM, see: http://www.linux-mm.org/ . Don't email: aart@kvack.org