Cycles embedding in folded hypercubes with conditionally faulty vertices

Kuo, Che-Nan; Cheng, Yu-Huei

doi:10.1016/j.dam.2016.12.008

Cited by 12 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[41]. Folded hypercubes are of wide current interest in reliability and fault tolerance of interconnection networks, see [9,21,25,42]. In this section we add to the known results on folded hypercubes their wirelength.…”

Section: Embeddings Of Folded Hypercubesmentioning

confidence: 99%

“…A closely related and important cost criterion is the wirelength of an embedding which is the sum of the dilations in the host graph of edges in the guest graph. The wirelength of a graph embedding arises from VLSI design, data structures and data representations, networks for parallel computer systems, biological models that deal with cloning and visual stimuli, parallel architecture, structural engineering and so on [21,31,41].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes

et al. 2020

View full text Add to dashboard Cite

Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is the hypercube due to its structural regularity, potential for parallel computation of various algorithms, and the high degree of fault tolerance. Thus it becomes the first choice of topological structure of parallel processing and computing systems. In this paper, lower bounds for the dilation, wirelength, and edge congestion of an embedding of a graph into a hypercube are proved. Two of these bounds are expressed in terms of the bisection width. Applying these results, the dilation and wirelength of embedding of certain complete multipartite graphs, folded hypercubes, wheels, and specific Cartesian products are computed.

show abstract

Section: Embeddings Of Folded Hypercubesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Some attractive properties of the folded hypercube are widely studied in the literature, such as, pancyclicity [8], conditional connectivity [9], stochastic edgefault-tolerant routing algorithm [7], conditional diagnosability [6] and conditional cycle embedding [5]. Recently, Dong and Wang [2] conjectured the following:…”

Section: Introductionmentioning

confidence: 99%