A SUPERPARALLEL SORTING ALGORITHM BASED ON NEURAL NETWORKS

被引:32
作者
TAKEFUJI, Y
LEE, KC
机构
[1] Department of Electrical Engineering, Center for Automation and Intelligent Systems Research, Case Western Reserve University, Cleveland
来源
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS | 1990年 / 37卷 / 11期
关键词
D O I
10.1109/31.62417
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A new neural network parallel algorithm for sorting problems is presented in this paper. The proposed algorithm using O(n2) processors requires two and only two steps, not depending on the size of the problem, while the conventional parallel sorting algorithm using O(n) processors proposed by Leighton needs the computation time Oog/i). A set of simulation results substantiates the proposed algorithm. The hardware system based on the proposed parallel algorithm is also presented in this paper. © 1990 IEEE
引用
收藏
页码:1425 / 1429
页数:5
相关论文
共 5 条
[1]  
ALON N, 1988, SIAM J COMPUTING, V17
[2]  
BATCHER KE, 1968, SPR P JOINT COMP C, V32
[3]  
LEIGHTON FT, 1984, 16TH P ANN ACM S THE, P71
[4]   A NEAR-OPTIMUM PARALLEL PLANARIZATION ALGORITHM [J].
TAKEFUJI, Y ;
LEE, KC .
SCIENCE, 1989, 245 (4923) :1221-1223
[5]  
Takefuji Y, 1990, IEEE Trans Neural Netw, V1, P143, DOI 10.1109/72.80215