- 30 1月, 2014 2 次提交
-
-
由 antirez 提交于
When we schedule a failover, broadcast a PONG to the slaves. The other slaves that plan to get elected will do the same too, this way it is likely that every slave will have a good picture of its own rank. Note that this is N*N messages where N is the number of slaves for the failing master, however usually even large clusters have many master nodes but a limited number of replicas per node, so this is harmless.
-
由 antirez 提交于
-
- 29 1月, 2014 7 次提交
-
-
由 antirez 提交于
Note that when we compute the initial delay, there are probably still more up to date information to receive from slaves with new offsets, so the delay is recomputed when new data is available.
-
由 antirez 提交于
Return the number of slaves for the same master having a better replication offset of the current slave, that is, the slave "rank" used to pick a delay before the request for election.
-
由 antirez 提交于
-
由 antirez 提交于
-
由 antirez 提交于
-
由 antirez 提交于
Accessing to the 'myself' node, the node representing the currently running instance, is handy without the need to type server.cluster->myself every time.
-
由 antirez 提交于
Now we can broadcast a pong to all the instances or just the local slaves (that is useful for replication offset propagation).
-
- 28 1月, 2014 4 次提交
-
-
由 antirez 提交于
-
由 antirez 提交于
-
由 antirez 提交于
The two fields are used in order to remember the latest known replication offset and the time we received it from other slave nodes. This will be used by slaves in order to start the election procedure with a delay that is proportional to the rank of the slave among the other slaves for this master, when sorted for replication offset. Usually this allows the slave with the most updated offset to win the election and replace the failing master in the cluster.
-
由 antirez 提交于
-
- 25 1月, 2014 1 次提交
-
-
由 antirez 提交于
-
- 24 1月, 2014 1 次提交
-
-
由 antirez 提交于
-
- 23 1月, 2014 3 次提交
- 22 1月, 2014 3 次提交
-
-
由 antirez 提交于
-
由 antirez 提交于
-
由 antirez 提交于
Incremental flushing in rio.c is only used to avoid huge kernel buffers synched to slow disks creating big latency spikes, so this fix has no durability implications, however it is certainly more correct to make sure that the FILE buffers are flushed to the kernel before calling fsync on the file descriptor. Thanks to Li Shao Kai for reporting this issue in the Redis mailing list.
-
- 20 1月, 2014 4 次提交
-
-
由 antirez 提交于
One of the simple heuristics used by Redis Cluster in order to avoid losing data in the typical failure modes created by the asynchronous replication with the slaves (a master is unable, when accepting a write, to immediately tell if it should be really accepted or refused because of a configuration change), is to wait some time before to rejoin the cluster after being partitioned away from the majority of instances. A similar condition happens when a master is restarted. It does not know if it was already failed over, nor if all the clients have already an updated configuration about the cluster map, so it is possible that clients will try to write to stale masters that were restarted. In a similar way this commit changes masters behavior so they wait 2000 milliseconds before accepting writes after a reboot. There is nothing special about 2 seconds if not to be a value supposedly larger a few orders of magnitude compared to the cluster bus communication latencies.
-
由 antirez 提交于
These were committed for error after being inserted in order to fix an issue.
-
由 antirez 提交于
-
由 antirez 提交于
-
- 18 1月, 2014 3 次提交
-
-
由 antirez 提交于
The code was doing checks for slaves that should be done only when the instance is currently a master. Switching a slave from a master to another one should just work.
-
由 antirez 提交于
When an instance is potentially set to replicate with another master, it is conceptually disconnected forever, since we have no old copy of the dataset for this master in memory.
-
由 antirez 提交于
-
- 17 1月, 2014 6 次提交
-
-
由 antirez 提交于
-
由 antirez 提交于
Also the :replicates info field in the node object is now correctly populated. This also fixes the :replicas field computation.
-
由 antirez 提交于
-
由 antirez 提交于
-
由 antirez 提交于
-
由 antirez 提交于
redis-trib should make sure to reconfigure slaves of a node to remove from the cluster to replicate with other nodes before sending CLUSTER FORGET.
-
- 16 1月, 2014 2 次提交
- 15 1月, 2014 4 次提交
-
-
由 antirez 提交于
CLUSTER FORGET is not useful if we can't remove a node from all the nodes of our cluster because of the Gossip protocol that keeps adding a given node to nodes where we already tried to remove it. So now CLUSTER FORGET implements a nodes blacklist that is set and checked by the Gossip section processing function. This way before a node is re-added at least 60 seconds must elapse since the FORGET execution. This means that redis-trib has some time to remove a node from a whole cluster. It is possible that in the future it will be uesful to raise the 60 sec figure to something bigger.
-
由 antirez 提交于
The hash table value should be set to now + 60 seconds otherwise it expires immediately.
-
由 antirez 提交于
We can't lookup by node->name that's not an SDS string but a plain C array in the node structure.
-
由 antirez 提交于
-