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:
“As I look at the human story I see two stories. They run parallel and never meet. One is of people who live, as they can or must, the events that arrive; the other is of people who live, as they intend, the events they create.”
—Margaret Anderson (1886–1973)
“If men at forty will be painting lakes
The ephemeral blues must merge for them in one,
The basic slate, the universal hue.”
—Wallace Stevens (1879–1955)