ppt - Distributed Systems文档.pptVIP

* If pushing, may not pick a susceptible node. If pulling, must be susceptible. Number of rounds is O(lg N). * * In real life, are there some people that just never heard some piece of gossip? * Figure 4-32. The relation between the fraction s of update-ignorant nodes and the parameter k in pure gossiping. The graph display ln(s) as a function of k. * * 进行信息的收集 * Collective operation From Wikipedia, the free encyclopedia Jump to: navigation, search A collective operation is a concept in parallel computing in which data is simultaneously sent to or received from many nodes. Common examples of