• Corpus ID: 15813751

Performance / Price Sort and PennySort

@inproceedings{Gray1998PerformanceP,
  title={Performance / Price Sort and PennySort},
  author={Jim Gray and Joshua Coates and Christian Nyberg},
  year={1998}
}
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. NT5.0 is not yet available. 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… 

Figures and Tables from this paper

2002 Performance / Price Sort and PennySort
TLDR
The paper presents the considerations when the program is customed, and reports its PennySort and Performance / Price Sort results, as well as Datamation Sort and Minute Sort results.
DMSort: A PennySort and Performance/Price Sort
TLDR
The DMSort system is discussed, which is capable of more than double the performance of previously published results when run on the authors' system configuration.
THSORT: A Single-Processor Parallel Sorting Algorithm
TLDR
Experimental results based on a computer with two RAIDs indicate that THSORT (Tsinghua SORT), a parallel sorting algorithm on a single computer, has almost doubled the performance of NTSORT, a famous sorting program.
A "Measure of Transaction Processing" 20 Years Later
  • J. Gray
  • Computer Science
    IEEE Data Eng. Bull.
  • 2005
TLDR
It is shown that improvement has exceeded Moore’s law – largely due to hardware improvements, software improvements, massive parallelism, and changing from mainframe to commodity economics.
SPsort: How to Sort a Terabyte Quickly
In December 1998, a 488 node IBM RS/6000 SP sorted a terabyte of data (10 billion 100 byte records) in 17 minutes, 37 seconds. This is more than 2.5 times faster than the previous record for a
A Low-Power Hybrid CPU-GPU Sort
TLDR
A balanced architecture with sufficient I/O to saturate available compute capacity is significantly more energy efficient compared to traditional machines and the CPU-GPU hybrid sort is marginally more efficient than a CPU-only sort.
Models and metrics for energy-efficient computer systems
TLDR
This dissertation describes the benchmark design, highlighting the challenges and pitfalls of energy-efficiency benchmarking that distinguish it from benchmarking pure performance, and describes the design of the machine with the highest known JouleSort score.
JouleSort: a balanced energy-efficiency benchmark
TLDR
This work proposes and motivate JouleSort, an external sort benchmark, for evaluating the energy efficiency of a wide range of computer systems from clusters to handhelds, and demonstrates a Joule sort system that is over 3.5x as energy-efficient as last year's estimated winner.
psort, Yet Another Fast Stable Sorting Software
TLDR
Ppsort's internals are detailed, and the careful fitting of its architecture to the structure of modern PCs-class platforms, allowing it to outperform state-of-the-art sorting software such as GNUsort or STXXL.
Uniformization of Discrete Data
TLDR
It is demonstrated that the sparsity decides the uniformity of the transformed data, and that could be a good reason to explain both the success of the bucket sort in PennySort 2003 and the failure for the same algorithm with the data modified.
...
1
2
...

References

SHOWING 1-10 OF 26 REFERENCES
AlphaSort: a RISC machine sort
TLDR
A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads and proposes two new benchmarks: Minutesort: how much can you sort in a minute, and DollarSort: how to sort for a dollar.
A super scalar sort algorithm for RISC processors
TLDR
New sort algorithms which eliminate almost all the compares, provide functional parallelism which can be exploited by multiple execution units, significantly reduce the number of passes through keys, and improve data locality are developed.
High-performance sorting on networks of workstations
We report the performance of NOW-Sort, a collection of sorting implementations on a Network of Workstations (NOW). We find that parallel sorting on a NOW is competitive to sorting on the large-scale
Design, analysis, and implementation of parallel external sorting algorithms
TLDR
A modified merge-sort is proposed to use as a method for eliminating duplicate records in a large file and a combinatorial model is developed to provide an accurate estimate for the cost of the duplicate elimination operation (both in the serial and the parallel cases).
Tuning a parallel database algorithm on a shared‐memory multiprocessor
TLDR
Volcano's parallel external sorting algorithm and a sequence of enhancements to improve its performance are presented, and very good absolute performance is obtained, 84 seconds for 100 MB of data, as well as near‐linear speedup with sixteen CPUs and disks.
A measure of transaction processing power
TLDR
These benchmarks measure the performance of diverse transaction processing systems and a standard system cost measure is stated and used to define price/performance metrics.
Sorting Large Files on a Backend Multiprocessor
TLDR
The results show that using current, off-the-shelf technology coupled with a streamlined distributed operating system, three- and five-microprocessor configurations, provide a very cost-effective sort of large files.
Nsort: a Parallel Sorting Program for NUMA and SMP Machines
TLDR
Ordinal TM Nsort TM is a high-performance sort program for SGI IRIX, Sun Solaris and HP-UX servers that can use tens of processors and hundreds of disks to quickly sort and merge data.
Sorting Large Data Files on POOMA
TLDR
The results show that the benchmark is able to exploit the full capabilities of the computing power, the storage devices and the communication bandwith and the applicability of the POOMA platform for this application, even where the POOL implementation was, at the time of the experiment, far from optimal.
A Low Communication Sort Algorithm for a Parallel Database Machine
TLDR
This work proposes a novel algorithm that exhibits complete parallelism during the sort, merge, and return-tohost phases, and decreases the amou@ of inter-processor communication compared to existing parallel sort algorithms.
...
1
2
3
...