This entry is part of the cache system entries. We have our LRU cache algorithm implemented, today we are going to explain the way the data is splitted around the nodes (caches), this process has the name of sharding.
A hashing algorithm is only a process where we get a position of the data based on the hash. This is commonly used in hash tables (dictionaries and stuff) in programming languages for example.
Before explaining the algorithm we selected, we will explain a regular sharding based on an example.