Performance / Price Sort

NTsort is an external sort on WindowsNT 5.0. It has minimal functionality but excellent price performance. In particular, running on mail-order hardware it can sort 1.5 GB for a penny. For commercially available sorts, Postman Sort from Robert Ramey Software Development has elapsed time performance comparable to NTsort, while using less processor time. It can sort 1.27 GB for a penny (12.7 million records.) These sorts set new price-performance records. This paper documents this and proposes that the PennySort benchmark be revised to Performance/Price sort: a simple GB/$ sort metric based on a two-pass external sort.

[1]  Honesty C. Young,et al.  A Low Communication Sort Algorithm for a Parallel Database Machine , 1989, VLDB.

[2]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[3]  Masaru Kitsuregawa,et al.  Evaluation of 18-stage Pipeline Hardware Sorter , 1989, IWDM.

[4]  Bjørn Arild W. Baugstø,et al.  Parallel Sorting Methods for Large Data Volumes on a Hypercube Database Computer , 1989, IWDM.

[5]  Bjørn Arild W. Baugstø,et al.  Sorting Large Data Files on POOMA , 1990, CONPAR.

[6]  Michael Stonebraker,et al.  A measure of transaction processing power , 1985 .

[7]  Dina Bitton Friedland.  Design, analysis, and implementation of parallel external sorting algorithms , 1981 .

[8]  David B. Lomet,et al.  AlphaSort: a RISC machine sort , 1994, SIGMOD '94.

[9]  Jim Gray,et al.  Nsort: a Parallel Sorting Program for NUMA and SMP Machines , 2000 .

[10]  Jean-Loup Baer,et al.  Improving Quicksort Performance with a Codewort Data Structure , 1989, IEEE Trans. Software Eng..

[11]  Ramesh C. Agarwal,et al.  A super scalar sort algorithm for RISC processors , 1996, SIGMOD '96.

[12]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[13]  David J. DeWitt,et al.  Parallel sorting on a shared-nothing architecture using probabilistic splitting , 1991, [1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems.

[14]  Yasuo Yamane,et al.  Parallel Partition Sort for Database Machines , 1987, IWDM.

[15]  Andrea C. Arpaci-Dusseau,et al.  High-performance sorting on networks of workstations , 1997, SIGMOD '97.

[16]  Kevin Wilkinson,et al.  Sorting Large Files on a Backend Multiprocessor , 1988, IEEE Trans. Computers.