# PDM sorting algorithms that take a small number of passes

##### Citations

88 citations

46 citations

44 citations

17 citations

### Cites result from "PDM sorting algorithms that take a ..."

...Preliminary versions of the results in this paper were presented in either [21] or [22]....

[...]

10 citations

##### References

17,939 citations

6,547 citations

2,895 citations

2,553 citations

### "PDM sorting algorithms that take a ..." refers background or methods in this paper

...Columnsort algorithm [15], odd-even merge sort [6], and the s(2)-way merge sort algorithms are all special cases of LMM sort [23]....

[...]

...The LMM sort of Rajasekaran [23] is optimal when N, B, and M are polynomially related and is a generalization of Batcher’s odd-even merge sort [6], Thompson and Kung’s s(2)-way merge sort [28], and Leighton’s columnsort [15]....

[...]

1,344 citations

### "PDM sorting algorithms that take a ..." refers background in this paper

...The bundle-sorting algorithm of Matias, Segal and Vitter [20] can be applied to this scenario but it is efficient only for a single disk model....

[...]

...It has been shown by Aggar- wal and Vitter [1] that Ω ( N DB log(N/B) log(M/B) ) I/O operations are needed to sort N keys (residing in D disks) when the block size is B....

[...]

...wal and Vitter [1] that Ω ( N DB log(N/B)...

[...]

...Unlike the bundle-sorting algorithm of Matias, Segal and Vitter [20] that is efficient only for a single disk model, our algorithm achieves full parallelism under very mild assumptions....

[...]

...Several efficient out-of-core algorithms have been devised by Arge, Ferragina, Grossi, and Vitter [3] for sorting strings....

[...]