From mboxrd@z Thu Jan 1 00:00:00 1970 Date: Wed, 4 Aug 2004 07:30:58 -0400 (EDT) From: Rik van Riel Subject: Re: [PATCH] token based thrashing control In-Reply-To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-linux-mm@kvack.org Return-Path: To: Song Jiang Cc: Con Kolivas , Andrew Morton , fchen@CS.WM.EDU, linux-mm@kvack.org, linux-kernel@vger.kernel.org List-ID: On Wed, 4 Aug 2004, Song Jiang wrote: > The intention behind the score = time/size is very sound, but > I am not sure how sensitive the performance is to the formula. > We may need to tune it carefully to make it valid. [snip] > Do we need to periodically compare the scores of registered processes? > If yes, that would take queueing complexity. Hmmm, good points. And my "queue of one" idea has the danger of registering a process that doesn't want the token any more by the time it's handed off... Maybe we should use the "time/size" score to influence the chance that a process gets to try and steal the token, in effect just modifying the odds. After all, thrashing should be a relatively rare situation, so the code should be as low impact as possible... -- "Debugging is twice as hard as writing the code in the first place. Therefore, if you write the code as cleverly as possible, you are, by definition, not smart enough to debug it." - Brian W. Kernighan -- 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