Parallel Merge
In parallel computing, arrays of sorted values may be merged efficiently using an all nearest smaller values computation.
Parallel merge can also be implemented using a divide-and-conquer algorithm, developed and shown in pseudo-code in. This algorithm performs well when combined with a fast sequential merge as a base case for merging of small arrays. Implementation using Intel's Threading Building Blocks (TBB) and Microsoft's Parallel Pattern Library (PPL) to run on multi-core processors is shown to perform well in practice.
Read more about this topic: Merge Algorithm
Famous quotes containing the words parallel and/or merge:
“The universe expects every man to do his duty in his parallel of latitude.”
—Henry David Thoreau (1817–1862)
“I too but signify at the utmost a little wash’d-up drift,
A few sands and dead leaves to gather,
Gather, and merge myself as part of the sands and drift.”
—Walt Whitman (1819–1892)