.png){kind=icon}
返回
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2023.104731.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and secure message distribution. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. Kao et al. (2019) [18] proposed an algorithm to construct independent spanning trees in bubble-sort networks. The algorithm is executed in a recursive function and thus is hard to parallelize. In this paper, we focus on the problem of constructing ISTs in bubble-sort networks Bn and present a non-recursive algorithm. Our approach can be fully parallelized, i.e., every vertex can determine its parent in each spanning tree in constant time. This solves the open problem from the paper by Kao et al. Furthermore, we show that the total time complexity O(n & BULL; n!) of our algorithm is asymptotically optimal, where n is the dimension of Bn and n! is the number of vertices of the network.& COPY; 2023 Elsevier Inc. All rights reserved.
Keyword:
Independent spanning trees
Bubble -sort networks
Interconnection networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
分享收藏In vivo voltammetric evidence that locus coeruleus activation predominantly releases norepinephrine in the infralimbic cortex: Effect of acute ethanol.png)
Synapse
SynapseIF0
PREAI
分享收藏The physiological role of ADP and Mg2+ in maintaining a stable beat cycle in bull spermCytoskeleton
CytoskeletonIF0
PREAI
分享收藏Reasonable and Risk‐Based? Replacing NFIP Generally Subsidized Rates with a Means‐Tested Subsidy
PREAI
分享收藏Ferromagnetic Mn-doped Si0.3Ge0.7nanodots self-assembled on Si(100)铁磁 Mn 掺杂 Si0.3Ge0.7 纳米点在 Si(100) 上自组装
PREAI
分享收藏
查看更多内容