Parallel Sorting Algorithm Using Multiwa
โ
Bhabani P. Sinha; Amar Mukherjee
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 288 KB
In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This algorithm, when implemented on a t dimensional mesh having n t nodes (t>2), sorts n t elements in O((t 2 &3t+2) n) time, thus offering a better order of time complexity than the [((t 2 &t) n log n)ร2+