|
概要（英語）
|
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.
|