An efficient multiway merging algorithm

被引：0
|
作者：
Lijun Zhao
Zhiyong Liu
Qingshi Gao
机构：
[1] Chinese Academy of Sciences,Institute of Computing Technology
[2] University of Science and Technology Beijing,Department of Computer Science
来源：
Science in China Series E: Technological Sciences | 1998年 / 41卷
关键词：
algorithm; sorting; merging; parallel processing;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Most traditional merging algorithms and merging-based sorting algorithms are based on 2-sorters. A newk-way merging algorithm is proposed. The aim of this algorithm is to mergek sorted lists, withm keys of each, into one, wherek can be any integer. The merging process uses onlyk sorters instead of 2 sorters. Thus,k-sorters is the primary operation of our algorithm. The time needed to mergek sorted lists is (21+([log(m/k)])tk, wheretk is the time to sortk keys.
引用
收藏
页码：543 / 551
页数：8
相关论文
共 50 条
12345