Optimal algorithms for dissemination of information
碩士 === 國立交通大學 === 應用數學系 === 90 === The purpose of this thesis is to investigate the problem of dissemination of information among processors of interconnection networks under the communication mode in which communications are via vertex-disjoint or edge-disjoint paths. In this communicati...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/63792960730488844314 |
| Summary: | 碩士 === 國立交通大學 === 應用數學系 === 90 === The purpose of this thesis is to investigate the problem of dissemination of information among processors of interconnection networks under the communication mode in which communications are via vertex-disjoint or edge-disjoint paths. In this communication mode, in one communication step, one or two processors send their information to all other processors via a path. Several processors can send information at a same step if the paths used one vertex/edge-disjoint. The complexity of a communication algorithm is measured by the number of communication steps.
In this thesis we design linear-time broadcast algorithms for trees in one-way listen-in vertex-disjoint mode and one-way listen-in edge-disjoint mode. We also design optimal broadcast, accumulation and gossip algorithms for complete k-ary trees and n-dimensional grid in two-way listen-in vertex-disjoint mode.
|
|---|