Performance comparison of distributive and mergesort as external sorting algorithms
- 1 October 1989
- journal article
- Published by Elsevier in Journal of Systems and Software
- Vol. 10 (3) , 187-200
- https://doi.org/10.1016/0164-1212(89)90031-9
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- External quicksortPerformance Evaluation, 1988
- Why merge?-An examination of disk sorting strategyIEEE Transactions on Computers, 1985
- The I/O Performance of Multiway Mergesort and Tag SortIEEE Transactions on Computers, 1985
- An Adaptive Method for Unknown Distributions in Distributive Partitioned SortingIEEE Transactions on Computers, 1985
- The Design and Analysis of BucketSort for Bubble Memory Secondary StorageIEEE Transactions on Computers, 1985
- Virtual Memory Behavior of Some Sorting AlgorithmsIEEE Transactions on Software Engineering, 1984
- Single Versus Double Buffering in Constrained MergingThe Computer Journal, 1982
- Working Sets Past and PresentIEEE Transactions on Software Engineering, 1980
- Sorting by distributive partitioningInformation Processing Letters, 1978
- Sorting in a paging environmentCommunications of the ACM, 1970