Patent ID: 11971824
Assignee: AETHERAI IP HOLDING LLC
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 9:
10. The method as claimed in claim 1, wherein the step (b) includes:
(b1′) identifying a longest path in a computational graph of a DNN with multiple trunk operations aligned therein and initializing a branch flag to zero;
(b2′) creating a new group and initializing a total working set size of the new group to zero;
(b3′) selecting a next one of the multiple trunk operations as a current trunk operation;
(b4′) determining if the current trunk operation has no dependency or only has dependency with a precedent trunk operation stored in the groups ever created and performing step (b7′) when a determination result of the current step is positive and step (b5′) when the determination result of the current step is negative;
(b5′) setting the branch flag to one;
(b6′) selecting a next one of at least one operation in at least one branch path toward the current trunk operation as a current branch operation;
(b7′) updating the total working set size by adding the working set size of the selected operation thereto for the new group;
(b8′) determining if the total working set size is less than a memory threshold and performing step (b10′) when a determination result of the current step is positive and step (b9′) when the determination result of the current step is negative;
(b9′) creating a new group and initialize a total working set size of the new group to zero and resume the step (b7′);
(b10′) storing the selected operation in the new group;
(b11′) determining if all the operations with which the selected operation has dependency is stored in the groups ever created and performing step (b12′) when a determination result of the current step is positive and step (b13′) when the determination result of the current step is negative;
(b12′) inserting a barrier between the selected operation and the operation before the selected operation;
(b13′) determining if the branch flag is zero and performing step (b16′) when a determination result of the current step is positive and step (b14′) when the determination result of the current step is negative;
(b14′) determining if the at least one operation in the at least one path branching from the current trunk operation are not completely selected and performing the step (b6′) when a determination result of the current step is positive and step (b15′) when the determination result of the current step is negative;
(b15′) setting the selected operation to the current trunk operation and the branch flag to zero and resuming the step (b7′); and
(b16′) determining if the selected operation is a final trunk operation and performing the step (b3′) when a determination result of the current step is positive and exiting when the determination result of the current step is negative.