Too me it reads like MapReduce for highly place-dependent computations, whatever that looks like. Probably something along the lines of a distributed kd-tree with message passing at borders handled for you as well.
Maybe that's why they showed a flying pirate scenario.
Imagine every object sitting on the same planet (object). Suddenly, everything interacts with everything.
You can't know if the object is a bee gently landing on a flower, or a 20 mile radius asteroid crashing into earth. The effect of the latter would be felt everywhere.
So, if every object was sitting on the same planet (object), even their system would probably crash and burn with n objects passing n^2 messages all the time.
The kd-tree idea sounds neat. They would need to adapt it however, to allow objects to move (to pass in and out of other objects' interaction radii).
Imagine every object sitting on the same planet (object). Suddenly, everything interacts with everything. You can't know if the object is a bee gently landing on a flower, or a 20 mile radius asteroid crashing into earth. The effect of the latter would be felt everywhere.
So, if every object was sitting on the same planet (object), even their system would probably crash and burn with n objects passing n^2 messages all the time.
The kd-tree idea sounds neat. They would need to adapt it however, to allow objects to move (to pass in and out of other objects' interaction radii).