All-to-All Personalized Communication Algorithms in Chordal Ring Networks

Authors:
Hiroshi Masuyama;Hiroshi Taniguchi;Tsutomu Miyoshi
Affiliations:
-;-;-
Venue:
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Year:
2001

Citing 8
Cited 0

Topological Properties of Hypercubes

IEEE Transactions on Computers
A Multiple Fault-Tolerant Processor Network Architecture for Pipeline Computing

IEEE Transactions on Computers
Fault-Tolerant Routing in Multistage Interconnection Networks

IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
All-to-All Broadcasting in Faulty Hypercubes

IEEE Transactions on Computers
An optimal routing algorithm for mesh-connected Parallel computers

Journal of the ACM (JACM)
Analysis of Chordal Ring Network

IEEE Transactions on Computers
A Fault-Tolerant Communication Architecture for Distributed Systems

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Chordal ring networks are ring structured and they become unreliable when nodes or arcs in the ring break down. Such a shortcoming can be circumvented by adding duplicate rings. Though this inherent topology of preparing many loops in the network structure is advantageous to broadcasting, no such broadcasting algorithms have been reported up until now.This paper discusses broadcasting algorithms for Chordal ring networks under the last one 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 to the critical faults is made clear.