Memcached by Brian Aker, Alan Kasindorf (dormando). Here are some quick, somewhat sparse notes. Follow the slides, it will help.<\/p>\n
Slides: http:\/\/download.tangent.org\/talks\/Memcached%20Study.pdf<\/a><\/p>\n Memcached was actually created for LiveJournal. It has evolved a bit over time. Chaos to user based clustering, and then Brad implemented memcached. LiveJournal has about 30GB of cache available between 8-12 machines. The DB reads were down like 10x the moment they started using memcached (its much better now).<\/p>\n Its not only for simple objects (not just a single row)- you can use it for complex queries, and the result can be stored in memcached. Eins.de, Patrick Lenz, is also the freshmeat.net guy. He put memcached on the same machine as the MySQL database server (he has 32-bit machines, and MySQL can only use a certain amount of RAM, so the rest was for memcached). This is definitely not the recommended way. Have separate memcached servers.<\/p>\n PatG comes up to talk about Grazr, which is more of a write-through cache. Refer to Page 8 of the slides. Now, the thought is that maybe Pat should’ve used gearman, rather than writing their own software. Memcached has allowed them to do it asynchronously. They’re using bulk inserts now as well.<\/p>\n DownUnder GeoSolutions uses lustre, which is a clustering filesystem. They’re not a web-based solution. They extract data off lustre, store it in memcached. Processing happens on the memcached RRU.<\/p>\n memcached by itself does very little. There’s a simple daemon, and it responds to gets\/sets\/add\/replace. It sits on top of a very simple slab allocator. Everytime you called it, it ran malloc() and it would free() it when done, during the early days. So, now, it makes one slab allocator for different types of objects.<\/p>\n memcached is event based. libevent is a generic wrapper around epoll\/kqueue, and its very scalable for network connections. 10,000 connections to a memcached, is ok – it only cares for how many of them are “active”.<\/p>\n The protocol is very simple. Everyone hates it, but everyone uses it. You can even fire up telnet to talk to memcached. Its very easy to write to protocol.txt and to talk to it.<\/p>\n memcached? A big stupid hash table. In a grid, its a distributed hash table. memcached is 2 hash tables – from client, and one in the server. 30 memcached’s don’t need to know about each other – they’re blind from each other. There is no cross traffic. You just add more servers, to scale up.<\/p>\n Clients hash keys to the server list. Take a single key (250 bytes max), the client hashes it. You have a value, you want to access it, here’s a key. There is multiple hashing going on, as some clients do things like compressing data.<\/p>\n How do I dump data? You don’t. Its a cache.<\/p>\n How is it redundant? Its not. The server itself doesn’t know about other servers around it! PECL and the next version of libmemcached will understand replication. The redundancy happens in clients.<\/p>\n How does it handle failover? It doesn’t. If it dies, it dies. A client can of course, handle it.<\/p>\n How does it authenticate? It doesn’t at all. Don’t stick one of this, open faced, to the Internet – when you connect to it, you have full access to any commands in the server and all contents in the server. You don’t want folk just typing flush in the server ;)<\/p>\n A very simple service, very simple server.<\/p>\n Details on the Server? Page 14, is pretty much all the commands you can use in memcached. You can run this from telnet, even All drivers you are seeing, are just basically extending all these commands. cas (compare and swap atomic!) today is pretty limited<\/p>\n memcached can even run on FreeBSD 4. Most people run memcached on Linux. No one has deployed memcahced on OSX in the audience.<\/p>\n There’s MySQL integration. Most users grab object from database, There’s pgmemcache() for Postgresql, but not much is known about it<\/p>\n Apache – mod_memcached, has CAS operations exposed. Different to the lighttpd implementation.<\/p>\n There are limitations (page 23). If you wanted to change things, you can recompile memcached, but you might not want to do that. Largest slab class in the system, is 1 megabyte. So data size is under 1 megabyte. Beware if you’re running on a 32-bit system (going over 4GB and you will segfault). A 64-bit system should be fine, in general.<\/p>\n memcached supports threads, thanks largely to Facebook. You probably don’t need this, unless you are Facebook. Memcached’s CPU footprint is tiny.<\/p>\n If you gave memcached 16GB, you will not get your memory back, even if you run flush. The memory is permanently allocated from the OS (much like how Vista does things?). There is mlockall() support, so you can guarantee there will be no paging. Or just disable swap.<\/p>\n jallspaw: memcached1: 22:02:00 up 992 days, 11:57, 0 users, load average: 0.35, 0.37, 0.37<\/p>\n (posted on IRC at #mysqlconf). memcached hardly every crashes.<\/p>\n You can disable the LRU if you want (there’s a command line option for this).<\/p>\n Hashing comes in 2 flavours – normal and consistent hashing. All drivers support CRC today.<\/p>\n A consistent hash means, that instead of doing a modular divide, you can interlace among many servers across the network. When you have a 100 servers running and add a server into the network, you want to add a server, and not lose the entire cache network at once.<\/p>\n libmemcached can do replicas, so it can take data from servers, and apply it to the ring. So if a server is taken out of the network, it can be found elsewhere on the ring. You can keep these networks up and running, and easily growing, with new servers, without losing cache coherency.<\/p>\n Don’t only look at the return value, look at the fact that zero may actually be a credible value, even. An actual value of zero, versus a “we didn’t find anything” is very different.<\/p>\n Slide 35, the ghetto locking implementation for memcache-client. Creates a pseudo-lock around a process. You’re the only process thats processing this area, so you add a key lock, where you ensure you test for nil, not zero (you’re testing for the existence of the lock). If your process dies, someone else will try in 30 seconds (lock expire). Add will only work if there’s no key existing at that point (remember, an add is not a set).<\/p>\n PHP is probably the best supported language, for memcached. PECL memcached library is C backed, standard, and works fine. libmemcached will probably take over most of its features, eventually, but its not there yet now.<\/p>\n Default, if you call increment by a key, it bumps by one. You can also step it up instead of 1, say like 500 or something. Refer to slide 41. Just like you can increment a key, you can decrement also.<\/p>\n C\/libmemcached. C driver, there’s a C++ wrapper. Sync and async cached keys. It supports replication through the network. Has read through cache support.<\/p>\n You can not only store a value, but you can also store flags. Flags to keep track of generations, keep track of MIME type internally (so not only store object type, but MIME type). This is unique for libmemcached. Most other drivers use this flags value to see if its compressed or not (the flag = 1 for compression, 0 for no).<\/p>\n Multiget is 7-9x faster than just a get. Look at Page 48 for an example.<\/p>\n Memcached for MySQL? Uses the UDF API. You can now incorporate most of the memcached stuff, in the SQL server, so you can do deletions and get operations easily.<\/p>\n http:\/\/tangent.org\/586\/Memcached_Functions_for_MySQL.html<\/a><\/p>\n What do you think about persistent connections? Use them. libevent supports them.<\/p>\n Spaces to watch: MogileFS. HyperTable. HBase. People have stopped talking about POSIX filesystems, and are more talking about object filesystems. Its what all the cool kids are doing.<\/p>\n Technorati Tags: memcached<\/a>, libmemcached<\/a>, brian aker<\/a>, alan kasindorf<\/a>, dormando<\/a>, krow<\/a>, livejournal<\/a>, grazr<\/a>, mysql<\/a>, mysqluc08<\/a>, mysqluc2008<\/a><\/p>\n
\n– set operation throws data inside memcached (it doesn’t care if there’s other data in it)
\n– add is lightly atomic – it won’t add data that is already there
\n– stats can give you particular pieces of information, or give you a full dump. Hit ratio, cache efficiency, and lots more, can come out of this<\/p>\n
\nstore object to memcached. The UDF memcached functions are probably the most successful UDF in MySQL’s history :)<\/p>\nShare this:<\/h3>