Memory-aware algorithms take advantage of the varying access characteristics. Long, long ago, computer memory was actually a rotating drum; each instruction chained to the next location; it was worth a lot of effort to place the instructions in such a manner that they'd be where you need them when they were needed.
Not every bit of information needs to be available Right Now; if we map access needs to the access capabilities, an SSD can be a great way to extend RAM cheaply. This is all the more true when newer flavors of SSD become available in the next few years. Terry McIntyre <[email protected]> On general principles, when we are looking for a solution of a social problem, we must expect to reach conclusions quite opposed to the usual opinions on the subject; otherwise it would be no problem. We must expect to have to attack, not what is commonly regarded as objectionable, but what is commonly regarded as entirely proper and normal. – John Beverley Robinson, 1897 ________________________________ From: Michael Williams <[email protected]> To: computer-go <[email protected]> Sent: Tuesday, May 12, 2009 9:48:19 AM Subject: Re: [computer-go] Implications of a CPU vs Memory trend on MCTS It depends on how you use it and how much you pay for it. If you get a high-end Intel SSD, you can treat it however you like. But I can't afford that. I got a cheap SSD and so I had shape my algorithm around which kind of disk operations it likes and which ones it doesn't. steve uurtamo wrote: > is the ssd fast enough to be practical? > > s. > > On Tue, May 12, 2009 at 12:41 PM, Michael Williams > <[email protected]> wrote: >> Don Dailey wrote: >>> On Tue, May 12, 2009 at 12:16 PM, Michael Williams >>> <[email protected] <mailto:[email protected]>> wrote: >>> >>> I have a trick ;) >>> >>> I am currently creating MCTS trees of over a billion nodes on my 4GB >>> machine. >>> >>> >>> Ok, I'll bite. What is your solution? >> I use an SSD. There are many details, of course. But it's still in the >> works and I'm still making lots of changes and adjustments. I seem to be >> able to "solve" (there are lots of definitions) 6x6 Go in that when I use a >> komi of 3.5, it is unable to find a winning line for white and when I use >> 4.5, it is unable to find a winning line for black. >> >> _______________________________________________ >> computer-go mailing list >> [email protected] >> http://www.computer-go.org/mailman/listinfo/computer-go/ >> > _______________________________________________ > computer-go mailing list > [email protected] > http://www.computer-go.org/mailman/listinfo/computer-go/ > _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
