Well, I think the abstraction here is easy enough ...
# swarm
i
Well, I think the abstraction here is easy enough to define. It’s an object graph, where each object has a location, and then an order of accessing the objects, and the task is to arrange the objects to minimize the number of times an object is accessed on one location, and then afterwards accessed on a different location