• Corpus ID: 7722804

FASTSORT: AN EXTERNAL SORT USING PARALLEL PROCESSING

@inproceedings{Tsukennan2002FASTSORTAE,
  title={FASTSORT: AN EXTERNAL SORT USING PARALLEL PROCESSING},
  author={Alex Tsukennan and Jim Gray and Michael Stewart and Susan Uren and Bonnie Vaughan and Alex Tsukerman},
  year={2002}
}
FastSort is an external sort that uses parallel processing, large main memories and parallel disc accesses to obtain high performance. FastSort can sort a file as quickly as it can read the input and it can produce the result as quickly as it can write the target file -that is it sorts in linear time rather than the traditional Nlog(N) time of serial sort systems. This paper describes the design and implementation of FastSort. It presents performance measurements of FastSort on various Tandem… 

Figures and Tables from this paper

Alphasort: A cache-sensitive parallel external sort
TLDR
A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads and argues that modern architectures require algorithm designers to re-examine their use of the memory hierarchy.
Sorting on a Cluster Attached to a Storage-Area Network
In November 2004, the SAN Cluster Sort program (SCS) set new records for the Indy versions of the Minute and TeraByte Sorts. SCS ran on a cluster of 40 dual-processor Itanium2 nodes on the show floor
A load-balanced parallel sorting algorithm for shared-nothing architectures
TLDR
This paper presents a load-balanced parallel sorting algorithm for shared-nothing architectures, a multiple-input multiple-output algorithm with four stages, based on a generalization of Batcher's odd-even merge, which guarantees its performance, as long as n is greater thanp3, which is the case of interest for sorting large relations.

References

SHOWING 1-10 OF 13 REFERENCES
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.
The Art in Computer Programming
TLDR
Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on.
Kevin Coughlin and Art Sheehan gave us valuable review comments on this document
  • REFERENCES
Large_Scale Processing
  • Focus, Vol. 4, No. Cupertino, CA, June
  • 1984
Sort and FastSort Manual, Tandem Part Num: 82442-A00, Tandem Computers Inc
  • Sort and FastSort Manual, Tandem Part Num: 82442-A00, Tandem Computers Inc
  • 1985
Tandem Part Num: 824:42-AOO Tandem Computers Inc Distributed by ~TANDEM Corporate Infonnation Center 10400 N
  • Tandem Part Num: 824:42-AOO Tandem Computers Inc Distributed by ~TANDEM Corporate Infonnation Center 10400 N
  • 1985
Sorting Using Multiple 2, Tandem Computers
  • Sorting Using Multiple 2, Tandem Computers
  • 1984
Large Scale Sorting Using Multiple Processing
  • Focus Tandem Computers
  • 1984
Vol
  • 3., Addison Wesley,
  • 1973
Credit-authorization Benchmark for High Performance and Linear Growth
  • Tandem Systems Review
  • 1986
...
...