Faster PHP fo shizzle
terrychay.com
terrychay.com
They've made it very clear that they're RAM limited (in particular with respect to capacity), so why not just have the processor compress/decompress memcache operations back and forth with a highly efficient and relatively low compression algorithm?
It's not even like you couldn't tune the algorithm to detect duplicate/similar data and create atomic globs of data that represent multiple informational objects.
It seems like their big cost is putting together machines with tons of RAM for their memcache clusters, so why not bring that cost down?
I've wondered the same thing--compression would be enormously helpful to us since we're RAM-bound (even with tons of RAM) and store a lot of easily compressible HTML. Further, our memcached instances show almost no CPU load.
That said, for more common scaling issues, I think compression would be a huge win, especially with Redis-style backends.
I'm quite sure they're already doing compression.
I thought large scale distributed servers were more bandwidth limited based on this paper (http://www.cs.cornell.edu/projects/ladis2009/talks/dean-keyn...)
This only works if execution time was a major part of the argument, and the site meets the conditions for benefiting from HipHop discussed in the article.
BTW It was the second time in a week that there was a product that created incredible buzz in HN community without anyone able to trying out the product (the other was iPad of course) and I was amazed at the amount of well-informed opinion based on such little information.
PS. This blog is a good reading if you are interested in Facebook architecture, scaling and design issues in general.
We're in the process of opening the list and approving members to the group. Code will follow soon after any recent cherges have been merged to the branch and we're sure that anything Facebook specific is removed.
More in the HipHop mailing list: http://groups.google.com/group/hiphop-php-dev/browse_thread/...