Patent ID: 11934887
Assignee: ZHEJIANG LAB
Field: Computer technology (Electrical engineering)
Classification: CPC G  Y | IPC G

Claim 6:
7. A distributed model compilation method, applied to a master node in a distributed model compilation system, comprising:
according to model information of a to-be-compiled model, determining a logic calculation graph of the to-be-compiled model;
dividing the logic calculation graph into a plurality of logic calculation sub-graphs;
for each of the plurality of the logic calculation sub-graphs, generating a distributing message, and transmitting the distributing message to one of a plurality of slave nodes of the distributed model compilation system, such that the slave node, according to the distributing message, allocates a local computing resource of the slave node to compile the logic calculation sub-graph contained in the distributing message based on the local computing resource to determine a task calculation sub-graph, and transmits compilation completion information to the master node according to the task calculation sub-graph;
in response to receiving compilation completion information returned from the plurality of the slave nodes, determining completion of a compilation of the to-be-compiled model; and
according to a compiled model, executing a target work;
wherein according to the model information of the to-be-compiled model, determining the logic calculation graph of the to-be-compiled model comprises:
receiving a compilation request;
according to the compilation request, creating an event executor that executes an event for the compilation request;
by the event executor, determining the model information of the to-be-compiled model according to the compilation request, and according to the model information of the to-be-compiled model, determining the logic calculation graph of the to-be-compiled model;
dividing the logic calculation graph into the plurality of the logic calculation sub-graphs, and for each of the plurality of the logic calculation sub-graphs, generating the distributing message comprises:
by the event executor, dividing the logic calculation graph into the plurality of the logic calculation sub-graphs, and for each of the plurality of the logic calculation sub-graphs, generating the distributing message;
transmitting the distributing message to one of the plurality of the slave nodes comprises:
by the event executor, transmitting the distributing message to one of the plurality of the slave nodes; and
in response to receiving the compilation completion information returned from the plurality of the slave nodes, determining the completion of the compilation of the to-be-compiled model, and executing the target work according to the compiled model comprises:
by the event executor, receiving the compilation completion information returned from the plurality of the slave nodes, determining the compiled model, and executing the target work;

wherein by the event executor, dividing the logic calculation graph into the plurality of the logic calculation sub-graphs comprises:
by the event executor, determining statuses of the plurality of the slave nodes; and
according to the statuses of the plurality of the slave nodes, dividing the logic calculation graph into the plurality of the logic calculation sub-graphs;

wherein according to the statuses of the plurality of the slave nodes, dividing the logic calculation graph into the plurality of the logic calculation sub-graphs comprises:
by the event executor, creating a session control executor; and
by the session control executor, according to the statuses of the plurality of the slave nodes, dividing the logic calculation graph into the plurality of the logic calculation sub-graphs, and determining a logic calculation sub-graph for each of the plurality of the slave nodes.