Synchronized Disk Interleaving
IEEE Transactions on Computers
A measure of transaction processing power
Datamation
Sorting Large Files on a Backend Multiprocessor
IEEE Transactions on Computers
Improving Quicksort Performance with a Codeword Data Structure
IEEE Transactions on Software Engineering
A low communication sort algorithm for a parallel database machine
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Sorting large data files on POOMA
CONPAR 90 Proceedings of the joint international conference on Vector and parallel processing
Tuning a parallel database algorithm on a shared-memory multiprocessor
Software—Practice & Experience
AlphaSort: a RISC machine sort
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Characterization of alpha AXP performance using TP and SPEC workloads
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
Parallel sorting on a shared-nothing architecture using probabilistic splitting
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Benchmark Handbook: For Database and Transaction Processing Systems
Benchmark Handbook: For Database and Transaction Processing Systems
Evaluation of 18-stage Pipeline Hardware Sorter
IWDM '89 Proceedings of the Sixth International Workshop on Database Machines
Parallel Sorting Methods for Large Data Volumes on a Hypercube Database Computer
IWDM '89 Proceedings of the Sixth International Workshop on Database Machines
A super scalar sort algorithm for RISC processors
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Effect of node size on the performance of cache-conscious B+-trees
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Implementing sorting in database systems
ACM Computing Surveys (CSUR)
GPUTeraSort: high performance graphics co-processor sorting for large database management
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Compression techniques for fast external sorting
The VLDB Journal — The International Journal on Very Large Data Bases
JouleSort: a balanced energy-efficiency benchmark
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
CellSort: high performance sorting on the cell processor
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
The five-minute rule twenty years later, and how flash memory changes the rules
DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware
The Five-Minute Rule 20 Years Later: and How Flash Memory Changes the Rules
Queue - Enterprise Flash Storage
The five-minute rule 20 years later (and how flash memory changes the rules)
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
psort, Yet Another Fast Stable Sorting Software
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
FSort: external sorting on flash-based sensor devices
Proceedings of the Sixth International Workshop on Data Management for Sensor Networks
FAST: Flash-aware external sorting for mobile database systems
Journal of Systems and Software
Self-selecting, self-tuning, incrementally optimized indexes
Proceedings of the 13th International Conference on Extending Database Technology
Analyzing the energy efficiency of a database server
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
A disk-aware algorithm for time series motif discovery
Data Mining and Knowledge Discovery
psort, yet another fast stable sorting software
Journal of Experimental Algorithmics (JEA)
TritonSort: a balanced large-scale sorting system
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Transactions on large-scale data- and knowledge-centered systems II
Transactions on large-scale data- and knowledge-centered systems II
Cache craftiness for fast multicore key-value storage
Proceedings of the 7th ACM european conference on Computer Systems
Foundations and Trends in Databases
TritonSort: A Balanced and Energy-Efficient Large-Scale Sorting System
ACM Transactions on Computer Systems (TOCS)
| Hi-index | 0.00 |
A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads. Using commodity processors, memory, and arrays of SCSI disks, AlphaSort runs the industry-standard sort benchmark in seven seconds. This beats the best published record on a 32-CPU 32-disk Hypercube by 8:1. On another benchmark, AlphaSort sorted more than a gigabyte in one minute. AlphaSort is a cache-sensitive, memory-intensive sort algorithm. We argue that modern architectures require algorithm designers to re-examine their use of the memory hierarchy. AlphaSort uses clustered data structures to get good cache locality, file striping to get high disk bandwidth, QuickSort to generate runs, and replacement-selection to merge the runs. It uses shared memory multiprocessors to break the sort into subsort chores. Because startup times are becoming a significant part of the total time, we propose two new benchmarks: (1) MinuteSort: how much can you sort in one minute, and (2) PennySort: how much can you sort for one penny.