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

Claim 7:
8. The method according to claim 1, wherein the one or more constraint condition comprises that:

Sq≥Cr−Msδqr−Ml(2−zq−zr)+Mr(xak+xck−xbk−xdk−2),

Sr≥Cq−Ms(1−δqr)−Ml(2−zq−zr)+Mr(xak+xck−xbk−xdk−2),

Sq≥Cr−Msδqr−Ml(2−zq−zr)+Mr(xbk+xdk−xak−xck−2),

Sr≥Cq−Ms(1−δqr)−Ml(2−qq−zr)+Mr(xbk+xdk−xakxck−2),

represents that when there are a plurality of communication tasks between two of the computing devices, one communication task is executed at a time,
wherein, Sq represents start time of the communication task q;
Cq represents end time of the communication task q;
Sr represents start time of a communication task r;
Cr represents end time of the communication task r;
δqr∈{0,1} represents an indicator variable; and
∀q, r∀V−V, q∉Succ(r) and r∉Succ(q), q≠r, (a,q),(q,b),(c,r),(r,d)∈Ē,
∀k∈K; and
Ms, Ml, Mr represent numbers tending to positive infinity relative to an index variable, a communication strategy and an assignment strategy, respectively.