登入選單
返回Google圖書搜尋
出版Center for Supercomputing Research and Development, University of Illinois, 1990
URLhttp://books.google.com.hk/books?id=sp2ZGwAACAAJ&hl=&source=gbs_api
註釋Abstract: "The gossip problem involves communicating a unique item from each node in a graph to every other node. We study the minimum time required to do this under the weakest model of parallel communication which allows each node to participate in just one communication at a time as either sender or receiver. We study a number of topologies including the complete graph, grids, hypercubes and rings. Definitive new optimal time algorithms are derived for complete graphs, rings, regular grids and toroidal grids that significantly extend existing results. In particular, we settle an open problem about minimum time gossiping in complete graphs.