libmemached, Replication for nodes...
« previous entry | next entry »
Feb. 27th, 2008 | 02:44 am
This was the idea.
With consistent hashing we have data spread out over servers. A loss of a single server removed 1/N of the available cache.
Not bad, but it is also not perfect for everyone. Some users would rather use more hardware and take an approach of fewer losses.
What needed to be done was to replicate the data to multiple node, and handle node failure. This has been on the list for a while :)
Did I get to it? Nope.
Did someone else? Yep.
I got a patch for this a few days ago from a user using memcached that needed it.
So now:
All you now need to do is set the number of servers you want to replicate to and you are in business. There is the problem of the split brain/error but not crash of the first node. If users are particularly worried an asynchronous fetch could be done with a compared result. I'm not sure this matters, but I'll probably consider it.
You can pull it from:
http://hg.tangent.org/libmemcached
hg update -C replication
I have it in a separate branch for the moment. 0.17 will be released in the next day, and I do not want this going out without more review.
Thanks to a cross Atlantic flight and a weird sleep schedule I finished this up tonight :)
With consistent hashing we have data spread out over servers. A loss of a single server removed 1/N of the available cache.
Not bad, but it is also not perfect for everyone. Some users would rather use more hardware and take an approach of fewer losses.
What needed to be done was to replicate the data to multiple node, and handle node failure. This has been on the list for a while :)
Did I get to it? Nope.
Did someone else? Yep.
I got a patch for this a few days ago from a user using memcached that needed it.
So now:
memcached_return enable_replication(memcached_st *memc)
{
uint64_t value;
value= 2;
memcached_behavior_set(memc, MEMCACHED_BEHAVIOR_REPLICAS, &value);
}
All you now need to do is set the number of servers you want to replicate to and you are in business. There is the problem of the split brain/error but not crash of the first node. If users are particularly worried an asynchronous fetch could be done with a compared result. I'm not sure this matters, but I'll probably consider it.
You can pull it from:
http://hg.tangent.org/libmemcached
hg update -C replication
I have it in a separate branch for the moment. 0.17 will be released in the next day, and I do not want this going out without more review.
Thanks to a cross Atlantic flight and a weird sleep schedule I finished this up tonight :)
couple other cool things
from:
mike503
date: Feb. 27th, 2008 11:25 am (UTC)
Link
http://pecl.php.net/package-changelog.p
there's also repcached which is a (new?) daemon that is basically a replicating memcached...
Reply | Thread
Re: couple other cool things
from:
krow
date: Feb. 27th, 2008 12:31 pm (UTC)
Link
Reply | Parent | Thread
in parallel?
from:
burtonator
date: Feb. 27th, 2008 05:40 pm (UTC)
Link
I've been meaning to do this with the Java client. I don't use memcached anymore so this really isn't a priority for me.
setMulti would use one frame and send multiple sets to the server at once.
This speeds removes gigabit ethernet latency for multiple sets/puts.
Also, does your replica support work in parallel? if you have many keys you need to set this is going to raise latency up a lot.
I've been known to underestimate gigabit latency in the past and I think it's a common mistake now.
If you implement both of these features it will fall from an O(N) function to O(1)....
The latency for N is small but if you have a large N then you might be screwed ;)
Kevin
Reply | Thread
Re: in parallel?
from:
jamesd
date: Feb. 28th, 2008 01:49 am (UTC)
Link
Reply | Parent | Thread
Re: in parallel?
from:
krow
date: Feb. 28th, 2008 10:29 am (UTC)
Link
Replica is in parallel for send if you are in async mode.
For fetch, it is not yet.
Yet :)
Reply | Parent | Thread