For example: If the root Process, p, knows p.state['min_UID'] = 4.
Then after the execution, all Processes q in the Network know
q.state['min_UID'].
|
|
|
|
|
trans_i(self,
p,
msgs)
Determines what state transition a Process, p, will perform, having
received messages, msgs |
source code
|
|
|
|
cleanup_i(self,
p)
Determines what final state transition a Process, p, will perform,
after the algorithm terminates. |
source code
|
|
|
Inherited from distalgs.Synchronous_Algorithm:
execute,
msgs,
print_algorithm_terminated,
round,
run,
trans
Inherited from distalgs.Algorithm:
__call__,
__init__,
cleanup,
count_msg,
delete,
get,
halt,
halt_i,
has,
increment,
output,
set
|