A parallel routing algorithm on circulant networks employing the Hamiltonian circuit latin square☆

Cho, Youngjoo; Chung, Ilyong

doi:10.1016/j.ins.2005.12.014

Cited by 6 publications

(6 citation statements)

References 8 publications

(7 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To our knowledge, this is the first time to propose a t/k diagnosis algorithm for GCNs and k $ 2. t/k diagnosis is of practical importance, especially when large fault sets exist. It is worthwhile to design t/k diagnosis algorithms for other interconnection networks (such as star network [2], folded hypercube [7], circulant network [3]), which is a matter of ongoing research.…”

Section: Discussionmentioning

confidence: 99%

A (4n − 9)/3 diagnosis algorithm for generalised cube networks

Yang

Xiao

Nayak

2010

International Journal of Parallel, Emergent and Distributed Sys

View full text Add to dashboard Cite

The goal of the t/k-diagnosis is to isolate all faulty processors (nodes) in a multiprocessor system to within a set of nodes in which at most k nodes are correct, provided the number of faulty nodes does not exceed t. As compared to the classical precise diagnosis strategy, the t/k-diagnosis strategy can significantly improve the selfdiagnosing capability of multiprocessor system. The generalised cube network (GCN), or equivalently the BC graphs, is a regular topology, which provides a unified view of the hypercube and some of its variants. This paper addressed the t/k-diagnosis of GCNs. By exploring the relationship between the size of a largest connected component of the 0-test subgraph of a faulty GCN and the distribution of the faulty nodes over the network, an OðN log 2 NÞ time (4n 2 9)/3 diagnosis algorithm on an n-dimensional GCN is presented, where N ¼ 2 n is the total number of the nodes of the network being diagnosed. To our knowledge, this is the first time to give a t/k-diagnosis algorithm for GCNs and k $ 2.

show abstract

Section: Discussionmentioning

confidence: 99%

A (4n − 9)/3 diagnosis algorithm for generalised cube networks

Yang

Xiao

Nayak

2010

International Journal of Parallel, Emergent and Distributed Sys

View full text Add to dashboard Cite

show abstract

“…[21][22][23][24][25], it is possible to design efficient t/k diagnosis algorithm on hypercube in respect to k P 4. The method developed in this work should be extended to design t/k diagnosis algorithms on other types of interconnection networks such as star network [1], circulant network [2], folded hypercube [4], crossed cube [6], hierarchical cubic network [9], supercube [15] and twisted cube [19], to name a few. The diagnosability results given in [7] will be helpful towards this research.…”

Section: Discussionmentioning

confidence: 99%

A (4n−9)/3 diagnosis algorithm on n-dimensional cube network

Xiao

Tang

2007

Information Sciences

View full text Add to dashboard Cite

“…However, many cases being disconnected on RCRðk; r; jÞ exist. One of them is from [00100, 1] to [00000, 1] on RCR (2,2,3). We now define the condition for RCRðk; r; jÞ as being a connected graph.…”

Section: Some Properties Of Rcr Networkmentioning

confidence: 99%

“…We must now look for algorithms that are capable of handling multiple data items simultaneously transmitted from a starting (source) node to a destination node. Several parallel routing algorithms have been designed on hypercube networks [1,7,17], star networks [5] and circulant networks [3].…”

Section: Introductionmentioning

confidence: 99%