Curious to discover how the hastable implemented in cachegrand ( https://github.com/danielealbano/cachegrand https://github.com/danielealbano/cachegrand ) - my

Curious to discover how the hastable implemented in cachegrand ( https://github.com/danielealbano/cachegrand https://github.com/danielealbano/cachegrand ) - my opensource Redis compatible Key-Value store - can deliver up to 112 million GET op/s and up to 85 million UPSERT op/s? I have just pushed the new documentation! https://github.com/danielealbano/cachegrand/blob/main/docs/architecture/hashtable.md https://github.com/danielealbano/cachegrand/blob/main/docs/a... When tested with memtier_benchmark, using the Redis protocol, cachegrand itself, on the benchmarking hardware, thanks to the implemented hashtable can reach up to 5 million GET op/s and up to 4.5 million UPSERT op/s without batching, with it up to 60 million GET op/s and up to 26 million UPSERT op/s!