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:
“We tend to be so bombarded with information, and we move so quickly, that there’s a tendency to treat everything on the surface level and process things quickly. This is antithetical to the kind of openness and perception you have to have to be receptive to poetry. ... poetry seems to exist in a parallel universe outside daily life in America.”
—Rita Dove (b. 1952)
“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)