3 ms·
BMC itself uses slow bytewise hashing and a slow old-school hash table. With keys of sizes 200-1000! > In userspace, Memcached consists of well-optimized data
by rurban 6y ago
BMC itself uses slow bytewise hashing and a slow old-school hash table. With keys of sizes 200-1000!
> In userspace, Memcached consists of well-optimized data structures to handle key-value pairs, with an LRU algorithm to evict “stale” data.
Memchached itself has also no well-optimized hashing nor a modern swiss-table like hashtable. It can be easily made at least 2x faster on modern CPU's.
Doing it upfront in the kernel is if course a better idea, but I would have expected at least proper modern core hashtables, not 90ies tech.