PARALLEL ADDRESS CALCULATION SORTING ON A NETWORK OF TRANSPUTERS

被引：0

作者：

WARING, LC ^{[1
]}

机构：

[1] QUEENS UNIV BELFAST,DEPT COMP SCI,BELFAST BT7 1NN,ANTRIM,NORTH IRELAND

来源：

MICROPROCESSING AND MICROPROGRAMMING | 1990年 / 26卷 / 05期

关键词：

Address calculation; Network; Processor farm; Sorting; Transputer;

D O I：

10.1016/0165-6074(90)90334-6

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Conventional comparison sorting algorithms are generally of complexity N log (N). Address calculation methods have been described which asymptotically approach complexity N with increasing data size. One of these (Pigeonsort) has been implemented on a single Transputer and on a network connected in a tree configuration. The performance of the algorithm in both cases is compared with Quicksort. The activity of the network during execution of the algorithm is analysed and the efficiency of processor use is evaluated. © 1990.

引用

页码：351 / 359

页数：9