At any time t, a node n is eligible for provisioning if t > T(n).
在任何的时间t,如果 t > T(n),则节点 n具有供应资格。
For each node n in the list L, carry out re-provisioning as follows
对于列表L 内的每个节点n,执行重新供应,如下所示
To do this asynchronously, the net traverses the distorted pattern, and at each node, n, it asks whether n's value should be set to -1 or + 1.
如果是异步完成,网络会遍历失真的图案,在每一个节点n,它会询问n的值应该设置为-1还是+ 1。
To do this asynchronously, the net traverses the distorted pattern, and at each node, n, it asks whether n's value should be set to -1 or + 1.
如果是异步完成,网络会遍历失真的图案,在每一个节点n,它会询问n的值应该设置为-1还是+ 1。
应用推荐