Author: Tom Kerrigan
Date: 11:34:01 07/24/98
Go up one level in this thread
On July 24, 1998 at 09:28:26, Robert Hyatt wrote: >however, if the memory management is done *right* then active programs page in, >inactive programs page out, and the paging stops, assuming (a) the active >program can actually fit into real memory and (b) that there are not more active >programs than can actually fit into real memory. Playing chess should have one >compute-bound process and the rest should slowly "go away" to disk. This is what happens in Windows. When you start a search, all of a sudden you're banging your program's entire memory space fast and at random. This more or less forces every other process to "go away" PDQ. When I'm using a large hash table in Win95, it takes a few seconds to swap in all the memory. Same thing happens when I use HP/UX. I'd be surprised if it isn't just as bad in LINUX. I was just thinking, it's possible that LINUX has a system where it allocates a lot of "unused" memory for each process and it has a lot of "unused" pages in RAM, so it can swap in an unused page simply by changing some memory around and not actually swapping... although this seems like it would be complicated and you basically wouldn't have the dynamic disk cache that you do with Win95... Cheers, Tom
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.