LUO Xiaoguang, LI Xiaomei. A QUICK PARALLEL ALGORITHM FOR SORTING ON A TWO DIMENSION MESHJ. Journal of Computer Research and Development, 1997, 34(S1).
Citation:
LUO Xiaoguang, LI Xiaomei. A QUICK PARALLEL ALGORITHM FOR SORTING ON A TWO DIMENSION MESHJ. Journal of Computer Research and Development, 1997, 34(S1).
LUO Xiaoguang, LI Xiaomei. A QUICK PARALLEL ALGORITHM FOR SORTING ON A TWO DIMENSION MESHJ. Journal of Computer Research and Development, 1997, 34(S1).
Citation:
LUO Xiaoguang, LI Xiaomei. A QUICK PARALLEL ALGORITHM FOR SORTING ON A TWO DIMENSION MESHJ. Journal of Computer Research and Development, 1997, 34(S1).
A QUICK PARALLEL ALGORITHM FOR SORTING ON A TWO DIMENSION MESH
Using the divide and conquer strategy recursively, a quick parallel algorithm for sorting N elements on a N×N mesh is presented. It needs totally 3 N+O（N 1/3 log N） steps. Each step includes one comparison and one exchange at most. Because a low bound of steps needed by sorting N elements on N×N mesh is 3 N-O(N ,the algorithm is nearly optimal.
DownLoad: