Automatically segmenting and populating a distributed computing problem

A method is described for automatically segmenting and populating a distributed problem, including determining a bounding space that is at least equal in size to a problem space volume, partitioning the bounding space into a plurality of sub-spaces capable of holding collections of original problem cells, mapping the distributed problem into the partitioned bounding space to populate the sub-spaces with data from the problem, and determining boundaries between the sub-spaces. The method further includes determining coupling interdependencies between sub-spaces, determining complexities associated with boundaries, calculating densities of the data from the problem, and if the densities of two or more contiguous collections fall below a lower level threshold, dynamically joining the two or more contiguous collections, if a particular collection density exceeds an upper threshold, dynamically subdividing the particular collection into a finer granularity, and processing the problem based on the boundaries, the coupling interdependencies, the complexities, and the densities.