英語タイトル | All-to-All Broadcasting and Personalized Communication Algorithms in Chordal Ring Networks |
---|---|
著者 | |
論文誌 | Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems |
巻 | |
号 | |
ページ | pp. 234-241 |
出版年 | 2001年8月 |
概要 | This paper discusses communication algorithms for Chordal ring networks under the last two of four different communication primitives: One-to-all broadcasting, one-to-all personalized communication, all-to-all broadcasting, all-to-all personalized communication. In this paper, Chordal ring networks are assumed to be not under critical faults, that is, the maximum number of faults we consider is 2. The number of time units required to the proposed algorithm which can tolerate under the non-critical faults is made clear. |
ファイル | BibTeX |