179 karma · joined April 15, 2008
"In 1981, at the age of 70, he tied for 3rd place in the U.S. Championship. In 1984, at the age of 72, he took first place in the powerful Reykjavik Open, which featured many grandmasters"
"... He won his last American championship in 1971 at the age of 59. In 1981, at 69, he was a finalist among Americans seeking to qualify for the world championship matches. And in 1984, at 72, he tied for first place in the Reykjavik International Tournament, his last world-class showing..."
http://www.nytimes.com/1992/04/07/nyregion/samuel-reshevsky-...
There's a story of how how when Reshevsky was quite old he went to watch a strong tournament in Europe and someone dropped out, and they asked him to be a last minute substitute ("house player"?) and didn't he surprise everyone by winning it?
But Korchnoi RIP, such great fighting spirit and interesting games.
Most notably in large value operations, and also slightly in random reads, sqlite3 wins. In in other benchmarks however, leveldb is faster.
The leveldb page notes that they perform poorly with large values due to the increased I/O that is done. The relatively poor random read performance isn't discussed but my guess is that it's due to having to fetch a compressed page of data that contains values for other keys, thus leveldb is doing "more work" than strictly necessary.
Then, you can essentially isolate out one of the variables, the strength of the "node", or client, engine, and you can play your Stockfish distributed against a Stockfish on a local box.
Of note is that there will still be 2 advantages the distributed version has: - more CPUs (obvious to everyone) - more RAM (well, obvious once you mention it)
If the distributed version is stronger then one question will be, was it more CPUs, or more RAM, that tipped the balance?
mv PATH/xmlrpc.php PATH/xmlrpc.php.nope
chmod 000 PATH/xmlrpc.php.nope
something like once an hour in case I upgraded and forgot to secure the site.In contrast I thought the Cluetrain Manifesto was better developed: http://www.cluetrain.com/
I work at Google and have interviewed O(250) people there.
In either case then the question is how does this affect the responsiveness of the system.
This paper http://downloads.basho.com/papers/bitcask-intro.pdf is a nice easy ready with another level of detail over the linked to article.
I suspect they could consider - varint encoding of the key and value sizes on disk - aligning some writes to disk block boundaries to avoid spanning 2 blocks
though both probably only have minor gains.
For more inspiration see Jeff Dean's comments on the SSTable data structure at Google: http://osdi2006.blogspot.com/2006/10/paper-bigtable-distribu...
though to be fair he follows with
"I think working hard is sometimes just as important to having a talent."
It's more normal at Google to have fewer people and 30 or 60 minute mtgs.
http://infoblog.stanford.edu/2008/08/spotsigs-are-stopwords-...