Method, system, computer readable medium, and device for scheduling computational operation based on graph data

One or more computer readable media storing executable instructions that, when executed by a computing device, cause the computing device to perform acts comprising:

• determining that an idle processor of multiple processors exists, the multiple processors being allocated with multiple partitions of graph data;
• considering an execution time of a respective partition to be computed and a migration overhead of the respective partition to be computed to obtain an evaluation result by evaluating losses and profits, the migration overhead of the respective partition to be computed including a respective time overhead including a first time overhead of transferring data of the respective partition to be computed from a first machine to a second machine and a second time overhead of rebuilding the respective partition on the second machine;
• causing the idle processor to communicate with one or more other processors to determine one or more partitions to be computed, according to respective degrees of criticality of respective partitions and the evaluation result, corresponding to the one or more other processors;
• and
• migrating and binding the determined one or more partitions to be computed to one or more threads of the idle processor for processing.

A system comprising:

• one or more processors;
• memory;
• a determination module stored in the memory and executable by the one or more processors to determine whether an idle processor of multiple processors exists, the multiple processors being allocated with multiple partitions of graph data;
• a selection module stored in the memory and executable by the one or more processors to consider an execution time of a respective partition to be computed and a migration overhead of the respective partition to be computed, and evaluate losses and profits, the migration overhead of the respective partition to be computed including a respective time overhead including a first time overhead of transferring data of the respective partition to be computed from a first machine to a second machine and a second time overhead of rebuilding the respective partition on the second machine;
• a communication module stored in the memory and executable by the one or more processors to cause the idle processor to communicate with one or more other processors to determine one or more partitions to be computed and corresponding to the one or more other processors based on an evaluation result of the selection module;
• and
• a migration module stored in the memory and executable by the one or more processors to migrate and bind the determined one or more partitions to be computed to one or more threads of the idle processor for processing.