 In its simplest form, given formula_9 sorted sequences formula_10 distributed evenly on formula_9 processors and a rank formula_7, the task is to find an element formula_40 with a global rank formula_7 in the union of the sequences.Hence, this can be used to divide each formula_20 in two parts at a splitter index formula_43, where the lower part contains only elements which are smaller than formula_40, while the elements bigger than formula_40 are located in the upper part.The presented sequential algorithm returns the indices of the splits in each sequence, e.g.