Filters








5 Hits in 1.2 sec

AlphaSort

Chris Nyberg, Tom Barclay, Zarka Cvetanovic, Jim Gray, Dave Lomet
1994 Proceedings of the 1994 ACM SIGMOD international conference on Management of data - SIGMOD '94  
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 a minute.  ...  A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads.  ...  These processors run the SPEC benchmark very well, because most SPEC benchmarks fit in the cache of newer RISC machines [14] .  ... 
doi:10.1145/191839.191884 dblp:conf/sigmod/NybergBCGL94 fatcat:oc7fev7jvnc4theoacfxryq3du

AlphaSort

Chris Nyberg, Tom Barclay, Zarka Cvetanovic, Jim Gray, Dave Lomet
1994 SIGMOD record  
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 a minute.  ...  A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads.  ...  These processors run the SPEC benchmark very well, because most SPEC benchmarks fit in the cache of newer RISC machines [14] .  ... 
doi:10.1145/191843.191884 fatcat:hq45a2l3rvg5hhaco3w3megqx4

Book reports

2006 Computers and Mathematics with Applications  
AlphaSort: A RISC Machine Sort. R* Optimizer Validation and Performance Evaluation for Distributed Queries. Mariposa: A Wide-Area Distributed Database System. Chapter 3.  ...  Anatomy of a Database System. Chapter 2. Query Process. Access Path Selection in a Relational Database Management System. Join Processing in Database System with Large Main Memories.  ... 
doi:10.1016/j.camwa.2006.03.015 fatcat:gb3jptptpbeuplumctpvzw2bsm

From Sand to Flour: The Next Leap in Granular Computing with NanoSort [article]

Theo Jepsen, Stephen Ibanez, Gregory Valiant, Nick McKeown
2022 arXiv   pre-print
To evaluate the feasibility and practicality of extremely fine-grained computing, we built NanoSort, a distributed sorting algorithm running on the nanoPU.  ...  In this work, we leverage the low communication latency of a new NIC/CPU hardware design, the nanoPU, to explore a new extreme of granularity in distributed computation, where a problem is partitioned  ...  Various sampling-based techniques have been proposed for sorting on a single machine: IPS 4 o [7] describes a distribution sort optimized for multi-core machines and LearnedSort [24] creates a hierarchecal  ... 
arXiv:2204.12615v1 fatcat:6drjd3iirzaiznm6wkrrksixom

Desktop batch processing

J. Gray, C. Nyberg
Proceedings of COMPCON '94  
The discussion is quantitative because the Transaction Processing Performance Council defined a set of benchmarks that characterize OLTP and that quantify price and performance.  ...  On the Datamation Sort benchmark [5] , AlphaSort sorted a million records in 7 seconds and sorted 10 million records (1 gigabyte) in less than a minute [6] .  ...  Using the "slow" array with a new memory-intensive algorithm called AlphaSort, we were able to sort records very quickly.  ... 
doi:10.1109/cmpcon.1994.282922 dblp:conf/compcon/GrayN94 fatcat:aofn7w7euzdgflkctaqt7exube