Fault-tolerant embedding of complete binary trees in locally twisted cubes

2017 ◽  
Vol 101 ◽  
pp. 69-78 ◽  
Author(s):  
Zhao Liu ◽  
Jianxi Fan ◽  
Jingya Zhou ◽  
Baolei Cheng ◽  
Xiaohua Jia
2011 ◽  
Vol 181 (11) ◽  
pp. 2268-2277 ◽  
Author(s):  
Xirong Xu ◽  
Wenhua Zhai ◽  
Jun-Ming Xu ◽  
Aihua Deng ◽  
Yuansheng Yang

2016 ◽  
Vol 88 ◽  
pp. 57-62 ◽  
Author(s):  
Xirong Xu ◽  
Yazhen Huang ◽  
Peng Zhang ◽  
Sijia Zhang

2012 ◽  
Vol 6-7 ◽  
pp. 70-75 ◽  
Author(s):  
Yue Juan Han ◽  
Jian Xi Fan ◽  
Lan Tao You ◽  
Yan Wang

The locally twisted cube is a newly introduced interconnection network for parallel computing, which possesses many desirable properties. In this paper, the problem of embedding complete binary trees into locally twisted cubes is studied.Let LTQn(V;E) denote the n-dimensional locally twisted cube.We find the following result in this paper: for any integern ≥ 2,we show that a complete binary tree with 2n—1 nodes can be embedded into the LTQn with dilation 2.


2019 ◽  
Vol 7 (3) ◽  
pp. 501-509
Author(s):  
Hui Shang ◽  
Eminjan Sabir ◽  
Ji-Xiang Meng

Sign in / Sign up

Export Citation Format

Share Document