PARALLEL SORTING ON CAYLE GRAPHS

被引：5
|
作者：
GORDON, DM
机构：
[1] Department of Computer Science, University of Georgia, Athens, 30602, GA
来源：
ALGORITHMICA | 1991年 / 6卷 / 04期
关键词：
SORTING; HYPERCUBE; SORTING NETWORK; PARALLEL ALGORITHM; COMPLEXITY;
D O I：
10.1007/BF01759059
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
This paper presents a parallel algorithm for sorting on any graph with a Hamiltonian path and 1-factorization. For an n-cube the algorithm is equivalent to the sequential balanced sorting network of Dowd, Perl, Rudolph, and Saks. The application of this algorithm to other networks is discussed.
引用
收藏
页码：554 / 564
页数：11
相关论文
共 50 条
12345