We propose that sorting be considered an important benchmark for both scientific and commercial applications of supercomputers. The purpose of a supercomputer benchmark is to exercise various system components in an effort to measure important performance characteristics. In the past numerous benchmarks have been defined in an effort to measure the performance issues associated with numeric computing. These benchmarks stressed arithmetic operations (in particular, floating-point arithmetic). In recent years supercomputers manufactures have started to look closer at non-numeric processing tasks, such as databases and information retrieval. The ability to operate on large amounts of non-numeric data will be crucial in the future. This paper discusses the appropriateness of sorting as a benchmark for non-numeric computing tasks. The paper describes previous work in this area and defines a set of architecture independent sorting benchmarks. Contact: Kurt Thearling
|
5824
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1990
|
|
2739
|
A mathematical theory of communication
– Shannon
- 1948
|
|
1206
|
Introduction to Parallel Algorithms and Architectures: Arrays
– Leighton
- 1992
|
|
380
|
Sorting networks and their applications
– Batcher
- 1968
|
|
241
|
Vector Models for Data-Parallel Computing
– Blelloch
- 1990
|
|
213
|
The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers
– Berry, Chen, et al.
- 1989
|
|
174
|
A comparison of sorting algorithms for the connection machine CM-2
– Blelloch, Leiserson, et al.
- 1991
|
|
174
|
Tight bounds on the complexity of parallel sorting
– Leighton
- 1985
|
|
140
|
The Livermore Fortran kernels: a computer test of the numerical performance range
– McMahon
- 1986
|
|
133
|
The Art of Computer Programming: Fundamental Algorithms, volume 1. 3rd edition
– Knuth
- 1997
|
|
129
|
A logarithmic time sort for linear size networks
– Reif, Valiant
- 1987
|
|
77
|
Parallel Sorting Algorithms
– Akl
- 1985
|
|
77
|
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related
– Cypher, Plaxton
- 1990
|
|
75
|
Sorting on a mesh-connected parallel computer
– Thompson, Kung
- 1977
|
|
68
|
The analysis of Quicksort programs
– Sedgewick
- 1977
|
|
46
|
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
– Frazer, McKellar
- 1970
|
|
42
|
Parallel Sorting and Data Partitioning by Sampling
– Huang, Chow
- 1983
|
|
34
|
Radix sort for vector multiprocessors
– Zagha, Blelloch
|
|
29
|
Implementations of randomized sorting on large parallel machines
– Hightower, Prins, et al.
- 1992
|
|
27
|
The NAS Kernel Benchmark Program
– Bailey, Barton
- 1985
|
|
27
|
The LINPACK benchmark: An explanation
– Dongarra
- 1987
|
|
23
|
A measure of transaction processing power
– Anon
- 1985
|
|
20
|
An Improved Supercomputing Sorting Benchmark", Proc Supercomputing 92
– Thearling, Smith
- 1992
|
|
17
|
Supporting the Hypercube Programming Model on Mesh Architectures (A Fast Sorter for iWarp Tori
– Stricker
- 1992
|
|
14
|
Hyperquicksort: A Fast Sorting Algorithm for Hypercubes, Hypercube Multiprocessors 1987
– Wagar
- 1987
|
|
13
|
A Balanced Bin Sort for Hypercube Multicomputers
– Won, Sahni
- 1988
|
|
12
|
Analysis and benchmarking of two parallel sorting algorithms: hyperquicksort and quickmerge
– Quinn
- 1989
|
|
10
|
Combining parallel and sequential sorting on a Boolean n-cube
– Johnsson
- 1984
|
|
9
|
Binsorting on Hypercubes with d-port Communication
– Seidel, George
- 1988
|
|
7
|
A Benchmark Parallel Sort for Shared Memory Multiprocessors
– Francis, Mathieson
- 1988
|
|
6
|
Timing results of some internal sorting algorithms on vector computers
– Roensch, Strauss
- 1987
|
|
4
|
Efficient bitonic sorting of large arrays on the maspar mp-1
– Prins
- 1990
|
|
3
|
An implementation of the radix sorting algorithm on the Touchstone Delta prototype
– Baber
- 1991
|
|
3
|
Parallel integer sorting with medium and fine-scale parallelism
– Dagum
- 1993
|
|
2
|
Radix sort on the hypercube
– Manzini
- 1991
|
|
2
|
Parallel sorting---a bibliography
– Richards
- 1986
|
|
2
|
An Efficient Multiprocessor Column Sort Algorithm on the Connection Machine CM-5. Unpublished manuscript
– White, Sheng
|
|
1
|
Timing Results of Some Internal Sorting Algorithms on the IBM-3090
– Carnevali
- 1988
|
|
1
|
Parallel sorting on Ametek/S14
– Li
- 1986
|
|
1
|
Timing Results of Some
– Moscinski, Rycerz, et al.
- 1989
|
|
1
|
Sorting algorithms for the Connection Machine CM-5, presentation at Thinking Machines Corporation
– Zagha
- 1992
|
|
