中文摘要：

基于倾斜与振荡法多路归并排序算法,提出了纵横多路并行归并算法,与已有方法递归应用两路归并过程不同.该算法直接对m×k的矩阵（m,k为任意整数）进行排序,消除了对两路递归过程的依赖,是一种新的多路归并排序算法.通过和倾斜与振荡法多路归并排序算法和高效的任意路并行归并算法的性能分析比较,当3（〈）k（〈）40时,该算法的时间复杂性低于同类算法.同时,该算法在专用硬件实现的设计复杂性上也具有明显的优势.

英文摘要：

Based on the sloping-and-shaking k-way merging and sorting algorithm, a vertical and horizontal multiway algorithm for parallel-merging is proposed, which is different from these methods which apply recursive two-way to merge. The algorithm is a sort of brand-new multiway merge sorting algorithm, whose main characteristic is to sort directly the m × k matrix （m, k is a random integer） and not to rely on recursively the two-way merge process. Compared with the sloping-and-shaking k-way merging and sorting algorithm and high efficiency multiway parallel merging algorithm, while k is big in three small in forty, the time complexity of the algorithm is lower than the uniformity algorithm. In the meantime, the design complexity realized in the special hardware of the algorithm has obvious advantage.