Fully Flexible Parallel Merge Sort for Multicore Architectures

Algorithm 1

The algorithm to divide tasks between processors .

1: for    to    do

2:For current processor, determine the starting number of the string to locate element,

3:Find the boundary indexes of the string to insert ,

4:Find the index of the next element before which the element is inserted,

5:For the computed index insert element into array ,

6:Wait for all processors,

7:For current processor, determine the starting number of the string to locate element,

8:Find the boundary indexes of the string to insert ,

9:Find the index of the next element before which the element is inserted,

10:For the computed index insert element into array ,

11:Wait for all processors,

12: end for