Task solving method and apparatus thereof
AssigneeHuawei Technologies Co., Ltd.
InventorsQiong CHEN, Yinlei SUN, Jie ZHOU
Life of this patent
Estimating the term…
Abstract
This application discloses a task solving method. The method includes: obtaining a search tree, where the search tree is obtained by solving a mixed integer programming task through branch and bound, the search tree includes a plurality of subnodes including a first subnode and a second subnode, each subnode corresponds to one child task, and the first subnode and the second subnode are to-be-solved subnodes in the plurality of subnodes; and determining a target parallel mode from a plurality of parallel modes based on information about the search tree, and solving at least one of the first subnode and the second subnode in parallel on a first device and a second device based on the target parallel mode.
Claims20
A task solving method, wherein the method comprises:
- obtaining a search tree, wherein the search tree is obtained by solving a mixed integer programming task through branch and bound, the search tree comprises a plurality of subnodes comprising a first subnode and a second subnode, each subnode corresponds to one child task, and the first subnode and the second subnode are to-be-solved subnodes in the plurality of subnodes;
- and
- determining a target parallel mode from a plurality of parallel modes based on information about the search tree, and solving at least one of the first subnode and the second subnode in parallel on a first device and a second device based on the target parallel mode, wherein the information about the search tree comprises at least one of first information and second information, the first information is related to a quantity of subnodes on the search tree, and the second information is related to a connection relationship between subnodes on the search tree.
An apparatus, wherein the apparatus comprises:
- a processor, and
- a memory coupled to the processor and configured to store a plurality of instructions that, when executed by the processor, causes the processor to:
- obtain a search tree, wherein the search tree is obtained by solving a mixed integer programming task through branch and bound, the search tree comprises a plurality of subnodes comprising a first subnode and a second subnode, each subnode corresponds to one child task, and the first subnode and the second subnode are to-be-solved subnodes in the plurality of subnodes;
- and
- determine a target parallel mode from a plurality of parallel modes based on information about the search tree, and solving at least one of the first subnode and the second subnode in parallel on a first device and a second device based on the target parallel mode, wherein the information about the search tree comprises at least one of first information and second information, the first information is related to a quantity of subnodes on the search tree, and the second information is related to a connection relationship between subnodes on the search tree.
A computer program product comprising computer-executable instructions stored on a non-transitory computer-readable storage medium, the computer-executable instructions when executed by one or more processors of an apparatus, cause the apparatus to:
- obtain a search tree, wherein the search tree is obtained by solving a mixed integer programming task through branch and bound, the search tree comprises a plurality of subnodes comprising a first subnode and a second subnode, each subnode corresponds to one child task, and the first subnode and the second subnode are to-be-solved subnodes in the plurality of subnodes;
- and
- determine a target parallel mode from a plurality of parallel modes based on information about the search tree, and solving at least one of the first subnode and the second subnode in parallel on a first device and a second device based on the target parallel mode, wherein the information about the search tree comprises at least one of first information and second information, the first information is related to a quantity of subnodes on the search tree, and the second information is related to a connection relationship between subnodes on the search tree.
Dependencies are inferred from the claim text.