s***h
发帖数: 662 | 1 consider a set of n processors, labeled p1, p2, ...pn. each trying to
broadcast a message. Time moves in discrete steps, and a processor will
succeed in broadcasting its message in step t if and only if no other
processors are trying to broadcast their messages in step t
since the processor cannot communicate directly, they try the following
randomized scheme to resolve contention. For a parameter m to be
determined later, they run a protocol that lasts for m consecutive phases,
each pha | s***h
发帖数: 662 | 2 ok, got it, it is (e*ln n)*(1+delta)
delta >= sqrt(-ln 0.05/e* ln n)
//relaxed
【在 s***h 的大作中提到】
: consider a set of n processors, labeled p1, p2, ...pn. each trying to
: broadcast a message. Time moves in discrete steps, and a processor will
: succeed in broadcasting its message in step t if and only if no other
: processors are trying to broadcast their messages in step t
: since the processor cannot communicate directly, they try the following
: randomized scheme to resolve contention. For a parameter m to be
: determined later, they run a protocol that lasts for m consecutive phases,
: each pha
|
|
