Quote: algorithm for parallel merge sort with a tree of processes

Note

from Friedland DB '82: parallel binary merge: with processor per track sort-merge 2**n sequences until 2**n >= 2*Number_of_processors. Then with a tree of processors whose leaves are the head processor, merge sequence pairs with pipelining until reach the root processor. The root processor generates the sorted sequence.

Related Topics

Topic: parallel algorithms (15 items)