On the Neighborhood-Connectivity of Locally Twisted Cube Networks

Author(s):  
Tzu-Liang Kung ◽  
Cheng-Kuan Lin ◽  
Chun-Nan Hung
Keyword(s):  
2021 ◽  
Author(s):  
Karthik K ◽  
Sudarson Jena ◽  
Venu Gopal T

Abstract A Multiprocessor is a system with at least two processing units sharing access to memory. The principle goal of utilizing a multiprocessor is to process the undertakings all the while and support the system’s performance. An Interconnection Network interfaces the various handling units and enormously impacts the exhibition of the whole framework. Interconnection Networks, also known as Multi-stage Interconnection Networks, are node-to-node links in which each node may be a single processor or a group of processors. These links transfer information from one processor to the next or from the processor to the memory, allowing the task to be isolated and measured equally. Hypercube systems are a kind of system geography used to interconnect various processors with memory modules and precisely course the information. Hypercube systems comprise of 2n nodes. Any Hypercube can be thought of as a graph with nodes and edges, where a node represents a processing unit and an edge represents a connection between the processors to transmit. Degree, Speed, Node coverage, Connectivity, Diameter, Reliability, Packet loss, Network cost, and so on are some of the different system scales that can be used to measure the performance of Interconnection Networks. A portion of the variations of Hypercube Interconnection Networks include Hypercube Network, Folded Hypercube Network, Multiple Reduced Hypercube Network, Multiply Twisted Cube, Recursive Circulant, Exchanged Crossed Cube Network, Half Hypercube Network, and so forth. This work assesses the performing capability of different variations of Hypercube Interconnection Networks. A group of properties is recognized and a weight metric is structured utilizing the distinguished properties to assess the performance exhibition. Utilizing this weight metric, the performance of considered variations of Hypercube Interconnection Networks is evaluated and summed up to recognize the effective variant. A compact survey of a portion of the variations of Hypercube systems, geographies, execution measurements, and assessment of the presentation are examined in this paper. Degree and Diameter are considered to ascertain the Network cost. On the off chance that Network Cost is considered as the measurement to assess the exhibition, Multiple Reduced Hypercube stands ideal with its lower cost. Notwithstanding it, on the off chance that we think about some other properties/ scales/metrics to assess the performance, any variant other than MRH may show considerably more ideal execution. The considered properties probably won't be ideally adequate to assess the effective performance of Hypercube variations in all respects. On the off chance that a sensibly decent number of properties are utilized to assess the presentation, a proficient variation of Hypercube Interconnection Network can be distinguished for a wide scope of uses. This is the inspiration to do this research work.


Crystals ◽  
2020 ◽  
Vol 10 (4) ◽  
pp. 239
Author(s):  
Donghoon Chung ◽  
Changyun Park ◽  
Woohyun Choi ◽  
Yungoo Song

In this study, we propose a revised structural model for highly ordered synthetic Ge-akaganéite, a stable analogue of tunnel-type Fe-oxyhydroxide, based on the Rietveld refinement of synchrotron X-ray diffraction data and density functional theory with dispersion correction (DFT-D) calculations. In the proposed crystal structure of Ge-akaganéite, Ge is found not only in the tunnel sites as GeO(OH)3− tetrahedra, but also 4/5 of total Ge atoms are in the octahedral sites substituting 1/10 of Fe. In addition, the tunnel structures are stabilized by the presence of hydrogen bonds between the framework OH and Cl− species, forming a twisted cube structure and the GeO(OH)3− tetrahedra corner oxygen, forming a conjugation bond. The chemical formula of the synthetic Ge-akaganéite was determined to be (Fe7.2Ge0.8)O8.8(OH)7.2Cl0.8(Ge(OH)4)0.2.


2000 ◽  
Vol 01 (02) ◽  
pp. 115-134 ◽  
Author(s):  
TSENG-KUEI LI ◽  
JIMMY J. M. TAN ◽  
LIH-HSING HSU ◽  
TING-YI SUNG

Given a shortest path routing algorithm of an interconnection network, the edge congestion is one of the important factors to evaluate the performance of this algorithm. In this paper, we consider the twisted cube, a variation of the hypercube with some better properties, and review the existing shortest path routing algorithm8. We find that its edge congestion under the routing algorithm is high. Then, we propose a new shortest path routing algorithm and show that our algorithm has optimum time complexity O(n) and optimum edge congestion 2n. Moreover, we calculate the bisection width of the twisted cube of dimension n.


2020 ◽  
Vol 31 (02) ◽  
pp. 233-252
Author(s):  
Yuejuan Han ◽  
Lantao You ◽  
Cheng-Kuan Lin ◽  
Jianxi Fan

The topology properties of multi-processors interconnection networks are important to the performance of high performance computers. The hypercube network [Formula: see text] has been proved to be one of the most popular interconnection networks. The [Formula: see text]-dimensional locally twisted cube [Formula: see text] is an important variant of [Formula: see text]. Fault diameter and wide diameter are two communication performance evaluation parameters of a network. Let [Formula: see text]), [Formula: see text] and [Formula: see text] denote the diameter, the [Formula: see text] fault diameter and the wide diameter of [Formula: see text], respectively. In this paper, we prove that [Formula: see text] if [Formula: see text] is an odd integer with [Formula: see text], [Formula: see text] if [Formula: see text] is an even integer with [Formula: see text].


2009 ◽  
Vol 16A (4) ◽  
pp. 223-226 ◽  
Author(s):  
Sook-Yeon Kim
Keyword(s):  

2018 ◽  
Vol 10 (02) ◽  
pp. 1850023
Author(s):  
Xiaofang Jiang ◽  
Qinghui Liu ◽  
N. Parthiban ◽  
R. Sundara Rajan

A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper, we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, Möbius cubes, crossed cubes, twisted cubes, locally twisted cube, spined cube, [Formula: see text]-cubes, etc., as the subfamilies.


Sign in / Sign up

Export Citation Format

Share Document