Speeding up external mergesort

IEEE Transactions on Knowledge and Data Engineering

Volumn 8, Issue 2, 1996, Pages 322-332

  Zheng, LuoQuan ^b   Larson, Per Åke ^a,c  

^a IEEE

^b IBM TORONTO LAB   (Canada)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Buffering strategy; External sorting; Mergesort; Run placement; Sorting

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; COMPUTER SIMULATION; INPUT OUTPUT PROGRAMS; MAGNETIC DISK STORAGE; MERGING; PERFORMANCE;

BUFFERING STRATEGY; EXTENT BASED FILE SYSTEM; EXTERNAL SORTING; HEURISTIC ALGORITHM; MERGESORT; RUN PLACEMENT;

SORTING;

EID: 0030121044     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.494169     Document Type: Article

References (18)

1. A. Aggarwal and J.S. Vitter, "The Input/Output Complexity of Sorting and Related Problems," Comm. ACM, vol. 31, no. 9, pp. 1,116-1,127, 1988.
2. S.G. Akl, Parallel Sorting Algorithms, Orlando, Fla.: Academic Press Inc., 1985.
3. J.L. Baer, Computer Systems Architecture, pp. 255-257. Rockville, Md.: Computer Science Press, 1980.
4. M. Beck, D. Bitton, and W.K. Wilkinson, "Sorting Large Files on a Backend Multiprocessor," IEEE Trans. Computers, vol. 37, pp. 769-778, 1988.
5. D. Bitton, "Design, Analysis, and Implementation of Parallel External Sorting Algorithms," PhD dissertation, Univ. of Wisconsin-Madison, TR 464, Jan. 1982.
6. J.L. Hennessy and D.A. Patterson, Computer Architecture: a Quantitative Approach, pp. 557-559. Morgan Kaufmann, 1990.
7. B.R. Iyer, R.G. Ricard, and P.J. Varman, "Percentile Finding Algorithm for Multiple Sorted Runs," Proc. 15th Int'l Conf. Very Large Data Bases, pp. 135-144, Amsterdam, 1989.
8. D.E. Knuth, The Art of Computer Programming: Volume 3. Reading, Mass.: Addison-Wesley, 1973.
9. S.C. Kwan and J.L. Baer, "The I/O Performance of Multiway Mergesort and Tag Sort," IEEE Trans. Computers, vol. 34 Special Issue on Sorting, pp. 383-387, 1985.
10. M.H. Nodine and J.S. Vitter, "Greed Sort: An Optimal External Sorting Algorithm for Multiple Disks," Dept. of Computer Science, Brown Univ., Technical Report CS-90-04, Feb. 1990.
11. V.S. Pai and P.J. Varman, "Prefetching with Multiple Disks for External Mergesort: Simulation and Analysis," Eighth Int'l Conf. Data Eng., pp. 273-282, Feb. 1992.
12. M.J. Quinn, "Parallel Sorting Algorithms for Tightly Coupled Multiprocessors," Parallel Computing, pp. 349-357. North-Holland, 1988.
13. B. Salzberg, "Merging Sorted Runs Using Large Main Memory," Acta Informatica, vol. 27, pp. 195-215, 1989.
14. B. Salzberg, A. Tsukerman, J. Gray, M. Stewart, S. Uren, and B. Vaughan, "FastSort: A Distributed Single-Input Single-Output External Sort," Proc. 1990 ACM SIGMOD Int'l Conf. Management of Data, pp. 94-101, May, 1990.
15. P.J. Varman, S.D. Scheufler, B.R. Iyer, and G.R. Ricard, "Merging Multiple lists on Hierarchical-Memory Multiprocessors," J. Parallel and Distributed Computing, vol. 12, pp. 171-177, 1991.
16. A.I. Verkamo, "Performance Comparison of Distributive and Mergesort as External Sorting Algorithms," J. Systems and Software, vol. 10, pp. 187-200, 1989.
17. J.S. Vitter and E.A. Shriver, "Optimal Disk I/O with Parallel Block Transfer," Symp. Theory of Computing, pp. 159-169, May, 1990.
18. L.Q. Zheng, "Speeding Up External Mergesort," Master's thesis, Univ. of Waterloo, 1992.