[1]张冰.一种新的并行分类算法[J].深圳大学学报理工版,1997,14(4):31-35.
 Zhang Bing.A New Parallel Sorting Scheme[J].Journal of Shenzhen University Science and Engineering,1997,14(4):31-35.
点击复制

一种新的并行分类算法()
分享到:

《深圳大学学报理工版》[ISSN:1000-2618/CN:44-1401/N]

卷:
第14卷
期数:
1997年4期
页码:
31-35
栏目:
电子与信息科学
出版日期:
1997-12-30

文章信息/Info

Title:
A New Parallel Sorting Scheme
作者:
张冰
深圳大学电子工程系,深圳518060
Author(s):
Zhang Bing
Dept. of Electronic Engineering Shenzhen University, Shenzhen 518060, P. R. China
分类号:
TP 338.6; TP 312
摘要:
提出一种建立在由独立的处理器构成的计算机网络(例如由Transputer构成的计算机网络)上的并行分类算法,用以解决分布式数据库的分类计算问题本文基于并行算法应与并行计算的拓扑结构相匹配的思想,设计了一种旨在减小处理器之间通讯开销的网络结构。在这样研中并行计算环境中,每石处理器运行同样的程序,计算负载均匀分布在每石处理器中,因而算法具有高度的并行性。同时这种基本结构还可以灵活地不断扩展,且随着网络的不断扩大,该并行算法的并行加速性更高。
Abstract:
In this paper, a new parallel sorting scheme based on a computer network connected by individual processors (such as Transputer Network) is presented, with the aim to solve the time-consuming sorting problem in distributed database applications. Based on the idea of matching the parallel algorithm with the topological structure of parallel computing, a network configuration with minimized interprocessor communication cost is designed. Under this parallel computing environment, every processor in the network executes the same program,and computing load is evenly distributed among the processors in the network, hence high parallelism can be achieved. In addition, the basic 10 processors configuration can be expanded flexibly into larger networks. As the network size grows, the efficiency of the parallel sorting algorithm becomes higher, and the algorithm has a very high parallel speed-up.
更新日期/Last Update: 2016-03-15