How would you design a distributed cache?

from collections import OrderedDict

class LRUCache:
    def __init__(self, capacity):
        self.capacity = capacity
        self.store = OrderedDict()
    def get(self, key):
        if key not in self.store:
            return None
        self.store.move_to_end(key)          # mark most-recently-used
        return self.store[key]
    def put(self, key, value):
        self.store[key] = value
        self.store.move_to_end(key)
        if len(self.store) > self.capacity:
            evicted, _ = self.store.popitem(last=False)   # drop least-recently-used
            print("evicted", evicted)

c = LRUCache(2)
c.put("a", 1); c.put("b", 2)
c.get("a")                  # 'a' is now most-recently-used
c.put("c", 3)               # over capacity -> evicts 'b'
print("a:", c.get("a"), "b:", c.get("b"), "c:", c.get("c"))