5,337
edits
Parallel Algorithms: Difference between revisions
→Technique: Merge Sorting Cluster
| Line 131: | Line 131: | ||
// Work | // Work | ||
for 1 <= i <= p pardo | for 1 <= i <= p pardo | ||
k = ceil(b(i)/(n/p)) | k = ceil(b(i)/(n/p)) * (n/p) | ||
merge slice A[(n/p)(i-1)+1:min(a(i), (n/p)i+1)] and B[b(i):min(b(i+1), | merge slice A[(n/p)(i-1)+1:min(a(i), (n/p)i+1)] and B[b(i):min(b(i+1), k)] | ||
</pre> | </pre> | ||