Merge Algorithm - Parallel Merge

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:

    There isn’t a Parallel of Latitude but thinks it would have been the Equator if it had had its rights.
    Mark Twain [Samuel Langhorne Clemens] (1835–1910)

    We don’t know when our name came into being or how some distant ancestor acquired it. We don’t understand our name at all, we don’t know its history and yet we bear it with exalted fidelity, we merge with it, we like it, we are ridiculously proud of it as if we had thought it up ourselves in a moment of brilliant inspiration.
    Milan Kundera (b. 1929)