- 21 Jul, 2020 1 commit
-
-
Oran Agra authored
-
- 16 Jul, 2020 1 commit
-
-
Itamar Haber authored
-
- 12 Jul, 2020 1 commit
-
-
Oran Agra authored
* update daily CI to include cluster and sentinel tests * update daily CI to run when creating a new release * update release scripts to work on the new redis.io hosts
-
- 10 Jul, 2020 1 commit
-
-
Oran Agra authored
-
- 28 Apr, 2020 1 commit
-
-
antirez authored
-
- 28 Feb, 2020 2 commits
-
-
Itamar Haber authored
-
Itamar Haber authored
Allows for setting the binaries path if used outside the upstream repo. Also documents `call` in usage clause (TODO: port to `redis-cli --cluster call` or just deprecate it).
-
- 11 Dec, 2019 1 commit
-
-
antirez authored
-
- 03 Dec, 2019 1 commit
-
-
antirez authored
-
- 19 Nov, 2019 2 commits
-
-
Johannes Truschnigg authored
Also, hint at example service unit files if systemd is detected. Thanks to @mika for spotting a bug in the original iteration of this patch.
-
Johannes Truschnigg authored
-
- 07 Oct, 2019 1 commit
-
-
Yossi Gottlieb authored
* Introduce a connection abstraction layer for all socket operations and integrate it across the code base. * Provide an optional TLS connections implementation based on OpenSSL. * Pull a newer version of hiredis with TLS support. * Tests, redis-cli updates for TLS support.
-
- 26 Sep, 2019 1 commit
-
-
nikhilajayk authored
-
- 02 Aug, 2019 2 commits
- 09 Mar, 2019 1 commit
-
-
Brad Solomon authored
It will fail pretty quickly since there is no -f readlink flag there.
-
- 01 Mar, 2019 1 commit
-
-
varianfeng authored
-
- 19 Feb, 2019 2 commits
- 18 Feb, 2019 2 commits
- 10 Oct, 2018 1 commit
-
-
antirez authored
-
- 03 Jul, 2018 1 commit
-
-
Jack Drogon authored
-
- 07 Jun, 2018 1 commit
-
-
antirez authored
-
- 07 May, 2018 1 commit
-
-
artix authored
- Updated README
-
- 26 Mar, 2018 1 commit
-
-
antirez authored
-
- 16 Mar, 2018 1 commit
-
-
antirez authored
-
- 14 Jul, 2017 1 commit
-
-
antirez authored
-
- 16 Jun, 2017 1 commit
-
-
Aric Huang authored
Fix a few typos/adjust wording in `create-cluster` README
-
- 14 Apr, 2017 1 commit
-
-
antirez authored
-
- 09 Mar, 2017 1 commit
-
-
antirez authored
-
- 16 Dec, 2016 1 commit
-
-
antirez authored
The PFADD now takes an array and has mandatory two arguments.
-
- 28 Jul, 2016 1 commit
-
-
antirez authored
-
- 20 Jul, 2016 1 commit
-
-
antirez authored
-
- 14 Jul, 2016 4 commits
-
-
antirez authored
-
antirez authored
-
antirez authored
-
antirez authored
We have 24 total bits of space in each object in order to implement an LFU (Least Frequently Used) eviction policy. We split the 24 bits into two fields: 8 bits 16 bits +--------+----------------+ | LOG_C | Last decr time | +--------+----------------+ LOG_C is a logarithmic counter that provides an indication of the access frequency. However this field must also be deceremented otherwise what used to be a frequently accessed key in the past, will remain ranked like that forever, while we want the algorithm to adapt to access pattern changes. So the remaining 16 bits are used in order to store the "decrement time", a reduced-precision unix time (we take 16 bits of the time converted in minutes since we don't care about wrapping around) where the LOG_C counter is halved if it has an high value, or just decremented if it has a low value. New keys don't start at zero, in order to have the ability to collect some accesses before being trashed away, so they start at COUNTER_INIT_VAL. The logaritmic increment performed on LOG_C takes care of COUNTER_INIT_VAL when incrementing the key, so that keys starting at COUNTER_INIT_VAL (or having a smaller value) have a very high chance of being incremented on access. The simulation starts with a power-law access pattern, and later converts into a flat access pattern in order to see how the algorithm adapts. Currenty the decrement operation period is 1 minute, however note that it is not guaranteed that each key will be scanned 1 time every minute, so the actual frequency can be lower. However under high load, we access 3/5 keys every newly inserted key (because of how Redis eviction works). This is a work in progress at this point to evaluate if this works well.
-
- 11 Jul, 2016 2 commits
-
-
antirez authored
-
antirez authored
1. Scan keys with pause to account for actual LRU precision. 2. Test cross-DB with 100 keys allocated in DB1. 3. Output results that don't fluctuate depending on number of keys. 4. Output results in percentage to make more sense. 5. Save file instead of outputting to STDOUT. 6. Support running multiple times with average of outputs. 7. Label each square (DIV) with its ID as HTML title.
-