【作者】 罗程； 钟诚； 杨锋； 米爱中；

【Author】 Luo Cheng Zhong Cheng Yang Feng Mi Aizhong 1 School of Computer and Electronics and Information, Guangxi University, Nanning 530004 2 Information Network Center, Guangxi University, Nanning 530004 3 Dept. of Computer Science and Technology, Jiaozuo Institute of Technology, Jiaozuo 454100

【机构】 广西大学计算机与电子信息学院；

【摘要】 从任意给定的n个数据中选取前m(m<n)个最小元素的问题称为(m,n)选择问题,它广泛应用于数据库系统、网络路由、人工智能搜索等领域。基于机群系统和MPI编程环境,设计与实现并行散列选择算法,实验结果表明算法获得良好的加速。更多还原

【Abstract】 The (m, n)-selection problem is to select the first m smallest elements from given n data, where m<n. It has been applied to many fields such as database system, network routing and artificial intelligence. Based on COW and MPI programming environment, a parallel selection algorithm using hashing technique is designed and implemented. The experimental result shows that this algorithm obtains good speedup.更多还原