Parallel Merge Sorting Algorithm Based on RAPWBN Model
After introducing the basic structure and the binary prefix sum operation of the reconfigurable computational model with wide bus network(RAPWBN),an algorithm for parallel merge sorting on RAPWBN model is presented.The algorithm can sort N elements in O((loglogN)2)time on a RAPWBN with Nα(1α2) processors and N-row bus with bandwidth ωlogN,the algorithm runs in O((loglogN)2)time.