From mboxrd@z Thu Jan 1 00:00:00 1970 Message-ID: <50969455.6030504@Princeton.EDU> Date: Sun, 4 Nov 2012 11:14:13 -0500 From: Martin Harriss User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:10.0.7) Gecko/20120829 Thunderbird/10.0.7 MIME-Version: 1.0 To: Fans of the OS Plan 9 from Bell Labs <9fans@9fans.net> References: <4A0E7310-9D9D-45C5-88A3-62B4A3191267@quintile.net> <20121103163103.GA48522@intma.in> <5cff355142bfe83410dce1c3fc321f25@kw.quanstro.net> <20121103165100.GA63071@intma.in> <7cd2c11374f75d628a5bb5e1f1d0919e@kw.quanstro.net> <20121103171322.GA76929@intma.in> <20121103174555.GA96072@intma.in> In-Reply-To: Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Subject: Re: [9fans] Kernel panic when allocating a huge memory Topicbox-Message-UUID: d360e0b0-ead7-11e9-9d60-3106f5b1d025 On 11/03/2012 02:48 PM, Charles Forsyth wrote: > local paging algorithms can avoid thrashing: "the process pages against > itself". > global paging algorithms typically do not (invariably do not, in my > experience, but most people use essentially the same one, so there might > be some that worked). > > Wilkes has a nice discussion of paging algorithms as an application of > control theory > in "The Dynamics of Paging". > http://comjnl.oxfordjournals.org/content/16/1/4.short > > "It is notorious that the use of apparently innocuous scheduling and > paging algorithms can give rise to the type of unstable behaviour known > as thrashing." Charles, Regarding local paging algorithms, perhaps at this juncture you should give yourself a pat on the back and post a pointer to the work you did applying the EMAS-style paging behaviour to Unix. (The EMAS papers are a joy to read, even 40 years on. I'd dig up a reference but here on the east coast of the US I'm in my 6th day without power and have other things to worry about right now.) Martin