.png){kind=icon}
返回
Generalized algorithm for parallel sorting on product networks
.png){kind=icon}
PRE
AI
DOI：10.1109/71.640013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We generalize the well-known odd-even merge sorting algorithm, originally due to Batcher [2], and show how this generalized algorithm can be applied to sorting on product networks. If G is an arbitrary factor graph with N nodes, its r-dimensional product contains N-r nodes. Our algorithm sorts N-2 keys stored in the r-dimensional product of G in O(r(2)F(N)) time, where F(M) depends on G. We show that, for any factor graph G, F(M) is, at most, O(N), establishing an upper bound of O(r(2) N) for the time complexity of sorting N-r keys on any product network. For product networks with bounded r(e.g., for grids), this leads to the asymptotic complexity of O(N) to sort N-r keys, which is optimal for several instances of product networks. There are factor graphs for which F(N) = O(log(2) N),which leads to the asymptotic running time of O(log(2) N) to sort N-r keys. For networks with bounded N (e.g., in the hypercube N = 2, fixed),nle asymptotic complexity becomes O(r(2)). We show how to apply the algorithm to several cases of well-known product networks, as well as others introduced recently. We compare the performance of our algorithm to well-known algorithms developed specifically for these networks, as well as others. The result of these comparisons led us to conjecture that the proposed algorithm is probably the best deterministic algorithm that can be found in terms of the low asymptotic complexity with a small constant.
Keyword:
sorting
interconnection networks
product networks
algorithms
odd-even merge
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容