Parallel processing for solution space partitions

A method, comprising:

• fragmenting a solution space associated with an optimization problem into a plurality of cells, wherein each cell comprises a respective disjoint subset of the solution space;
• selecting a first cell of the plurality of cells;
• fragmenting the first cell into a plurality of sub-cells;
• determining a respective initial solution to the optimization problem for each of the plurality of sub-cells;
• launching a respective processing thread for each of the plurality of sub-cells;
• and
• executing each respective processing thread at least partially in parallel, wherein executing each respective processing thread comprises determining a respective elite solution to the optimization using the respective initial solution associated with the corresponding sub-cell of the plurality of sub-cells.

A system, comprising:

• a central processing unit (CPU);
• a graphical processing unit (GPU) comprising a plurality of arithmetic logic units (ALUs);
• at least one memory storing computer-executable instructions;
• and
• one or more buses that operatively couple the CPU, the GPU, and the at least one memory,
• wherein the CPU is configured to access the at least one memory via at least one bus of the one or more buses and execute the computer-executable instructions to:
• fragment a solution space associated with an optimization problem into a plurality of cells, wherein each cell comprises a respective disjoint subset of the solution space;
• and
• cause the GPU to launch a respective GPU thread to process a corresponding cell of the plurality of cells, wherein each respective GPU thread utilizes a corresponding ALU of the plurality of ALUs to process the corresponding cell to determine a respective solution to the optimization problem.