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:
“If from the earth we came, it was an earth
That bore us as a part of all the things
It breeds and that was lewder than it is.
Our nature is her nature. Hence it comes,
Since by our nature we grow old, earth grows
The same. We parallel the mother’s death.”
—Wallace Stevens (1879–1955)
“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)