Construction Algorithm of Completely Independent Spanning Tree in Dragonfly Network
Dragonfly network,proposed by Kim et al.,is a topology for high-performance computer systems.In dragonfly network,compute nodes are attached to switches,the switches are organized into groups,and the network is organized as a two-level clique.There is a link between any two nodes in a group,and ther...
Main Author: | BIAN Qing-rong, CHENG Bao-lei, FAN Jian-xi, PAN Zhi-yong |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial office of Computer Science
2022-11-01
|
Series: | Jisuanji kexue |
Subjects: | |
Online Access: | https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-11-284.pdf |
Similar Items
-
Completely Independent Spanning Trees in (Partial) k-Trees
by: Matsushita Masayoshi, et al.
Published: (2015-08-01) -
Completely Independent Spanning Trees in k-Th Power of Graphs
by: Hong Xia
Published: (2018-08-01) -
Algorithm to Construct Node-independent Spanning Trees in Data Center Network BCDC
by: PAN Zhi-yong, CHENG Bao-lei, FAN Jian-xi, BIAN Qing-rong
Published: (2022-07-01) -
Completely independent spanning trees in some Cartesian product graphs
by: Xia Hong, et al.
Published: (2023-05-01) -
Constructing Independent Spanning Trees on Pancake Networks
by: Dun-Wei Cheng, et al.
Published: (2020-01-01)