Patent ID: 8606844
Filing Date: 2013-12-10
Classification: G06F

Abstract:
1. A method of automatically segmenting and populating a distributed problem, comprising: 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 plurality of sub-spaces with data from the distributed problem; processing, on one or more computers, the distributed problem based on the populated sub-spaces; determining boundaries between the subspaces; determining coupling interdependencies between the subspaces; determining complexities associated with the boundaries; calculating densities of the data from the problem, wherein the calculating is based on one or more of the boundaries between the subspaces, the interdependencies between the subspaces, and the complexities associated with the boundaries; 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; monitoring a performance of the processing on the one or more computers; and managing load of the distributed problem on the one or more computers based on the monitoring.