Performance of distributive partitioned sort in a demand paging environment
Date of Original Version
The performances of Distributive Partitioned Sort (DPS) and Quicksort are compared empirically in a demand paging environment. It is found that DPS requires an amount of real memory equal to approximately 40 to 50% in its image size in order to run faster than Quicksort. The performance of DPS deteriorates rapidly in smaller partitions due to excessive page faulting, while that of Quicksort remains fairly constant. © 1987.
Information Processing Letters
Hyslop, Gary A., and Edmund A. Lamagna. "Performance of distributive partitioned sort in a demand paging environment." Information Processing Letters 25, 1 (1987): 61-64. doi:10.1016/0020-0190(87)90094-9.