- 12 2月, 2014 2 次提交
-
-
由 antirez 提交于
-
由 antirez 提交于
A system similar to the RDB write error handling is used, in which when we can't write to the AOF file, writes are no longer accepted until we are able to write again. For fsync == always we still abort on errors since there is currently no easy way to avoid replying with success to the user otherwise, and this would violate the contract with the user of only acknowledging data already secured on disk.
-
- 08 2月, 2014 1 次提交
-
-
由 antirez 提交于
-
- 07 2月, 2014 1 次提交
-
-
由 antirez 提交于
-
- 03 2月, 2014 1 次提交
-
-
由 antirez 提交于
-
- 31 1月, 2014 2 次提交
-
-
由 antirez 提交于
This is especially important since we already have a concept of backlog (the replication backlog).
-
由 Nenad Merdanovic 提交于
In high RPS environments, the default listen backlog is not sufficient, so giving users the power to configure it is the right approach, especially since it requires only minor modifications to the code.
-
- 28 1月, 2014 1 次提交
-
-
由 antirez 提交于
-
- 23 12月, 2013 1 次提交
-
-
由 antirez 提交于
This was no longer the case with 2.8 becuase of a bug introduced with the IPv6 support. Now it is fixed. This fixes issue #1287 and #1477.
-
- 19 12月, 2013 1 次提交
-
-
由 Yubao Liu 提交于
Those options will be thrown without this patch: include, rename-command, min-slaves-to-write, min-slaves-max-lag, appendfilename.
-
- 11 12月, 2013 1 次提交
-
-
由 antirez 提交于
When a slave was disconnected from its master the replication offset was reported as -1. Now it is reported as the replication offset of the previous master, so that failover can be performed using this value in order to try to select a slave with more processed data from a set of slaves of the old master.
-
- 05 12月, 2013 1 次提交
-
-
由 antirez 提交于
-
- 28 11月, 2013 2 次提交
- 21 11月, 2013 2 次提交
-
-
由 antirez 提交于
This commit introduces a funciton called when Sentinel is ready for normal operations to avoid putting Sentinel specific stuff in redis.c.
-
由 antirez 提交于
Some are just to know if the master is down, and in this case the runid in the request is set to "*", others are actually in order to seek for a vote and get elected. In the latter case the runid is set to the runid of the instance seeking for the vote.
-
- 29 10月, 2013 6 次提交
-
-
由 antirez 提交于
-
由 antirez 提交于
-
由 antirez 提交于
-
由 antirez 提交于
Sorting the output helps when we want to turn a non-deterministic into a deterministic command, in that case this is not possible.
-
由 Pieter Noordhuis 提交于
-
由 Pieter Noordhuis 提交于
-
- 17 9月, 2013 1 次提交
-
-
由 antirez 提交于
-
- 27 8月, 2013 1 次提交
-
-
由 antirez 提交于
-
- 22 8月, 2013 2 次提交
- 21 8月, 2013 4 次提交
- 06 8月, 2013 6 次提交
-
-
由 antirez 提交于
Example: db0:keys=221913,expires=221913,avg_ttl=655 The algorithm uses a running average with only two samples (current and previous). Keys found to be expired are considered at TTL zero even if the actual TTL can be negative. The TTL is reported in milliseconds.
-
由 antirez 提交于
We don't want to repeat a fast cycle too soon, the previous code was broken, we need to wait two times the period *since* the start of the previous cycle in order to avoid there is an even space between cycles: .-> start .-> second start | | +-------------+-------------+--------------+ | first cycle | pause | second cycle | +-------------+-------------+--------------+ The second and first start must be PERIOD*2 useconds apart hence the *2 in the new code.
-
由 antirez 提交于
-
由 antirez 提交于
-
由 antirez 提交于
This commit makes the fast collection cycle time configurable, at the same time it does not allow to run a new fast collection cycle for the same amount of time as the max duration of the fast collection cycle.
-
由 antirez 提交于
The main idea here is that when we are no longer to expire keys at the rate the are created, we can't block more in the normal expire cycle as this would result in too big latency spikes. For this reason the commit introduces a "fast" expire cycle that does not run for more than 1 millisecond but is called in the beforeSleep() hook of the event loop, so much more often, and with a frequency bound to the frequency of executed commnads. The fast expire cycle is only called when the standard expiration algorithm runs out of time, that is, consumed more than REDIS_EXPIRELOOKUPS_TIME_PERC of CPU in a given cycle without being able to take the number of already expired keys that are yet not collected to a number smaller than 25% of the number of keys. You can test this commit with different loads, but a simple way is to use the following: Extreme load with pipelining: redis-benchmark -r 100000000 -n 100000000 \ -P 32 set ele:rand:000000000000 foo ex 2 Remove the -P32 in order to avoid the pipelining for a more real-world load. In another terminal tab you can monitor the Redis behavior with: redis-cli -i 0.1 -r -1 info keyspace and redis-cli --latency-history Note: this commit will make Redis printing a lot of debug messages, it is not a good idea to use it in production.
-
- 18 7月, 2013 1 次提交
-
-
由 antirez 提交于
-
- 16 7月, 2013 1 次提交
-
-
由 yoav 提交于
-
- 12 7月, 2013 1 次提交
-
-
由 antirez 提交于
-
- 11 7月, 2013 1 次提交
-
-
由 antirez 提交于
-