1. 21 Jul, 2020 1 commit
  2. 16 Jul, 2020 1 commit
  3. 12 Jul, 2020 1 commit
  4. 10 Jul, 2020 1 commit
  5. 28 Apr, 2020 1 commit
  6. 28 Feb, 2020 2 commits
  7. 11 Dec, 2019 1 commit
  8. 03 Dec, 2019 1 commit
  9. 19 Nov, 2019 2 commits
  10. 07 Oct, 2019 1 commit
    • Yossi Gottlieb's avatar
      TLS: Connections refactoring and TLS support. · b087dd1d
      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.
      b087dd1d
  11. 26 Sep, 2019 1 commit
  12. 02 Aug, 2019 2 commits
  13. 09 Mar, 2019 1 commit
  14. 01 Mar, 2019 1 commit
  15. 19 Feb, 2019 2 commits
  16. 18 Feb, 2019 2 commits
  17. 10 Oct, 2018 1 commit
  18. 03 Jul, 2018 1 commit
  19. 07 Jun, 2018 1 commit
  20. 07 May, 2018 1 commit
  21. 26 Mar, 2018 1 commit
  22. 16 Mar, 2018 1 commit
  23. 14 Jul, 2017 1 commit
  24. 16 Jun, 2017 1 commit
  25. 14 Apr, 2017 1 commit
  26. 09 Mar, 2017 1 commit
  27. 16 Dec, 2016 1 commit
  28. 28 Jul, 2016 1 commit
  29. 20 Jul, 2016 1 commit
  30. 14 Jul, 2016 4 commits
    • antirez's avatar
      LFU simulator: remove dead code. · ada70c7c
      antirez authored
      ada70c7c
    • antirez's avatar
      LRU simulator: fix new entry creation decr time. · fc92c667
      antirez authored
      fc92c667
    • antirez's avatar
      LRU simulator: fix new entry creation. · f50dc38b
      antirez authored
      f50dc38b
    • antirez's avatar
      LFU: Simulation of the algorithm planned for Redis. · 09fcb002
      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.
      09fcb002
  31. 11 Jul, 2016 2 commits
    • antirez's avatar
      LRU: Fix output fixes to new test-lru.rb. · b19b2dff
      antirez authored
      b19b2dff
    • antirez's avatar
      LRU: test-lru.rb improved in different ways. · 32a54943
      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.
      32a54943