Special update for 2008:
Due to Jim Gray’s ongoing absence, for 2007 results and beyond please see the new Sort Benchmark Home Page.
.
Year 2006 Results
|
||
|
|
Daytona |
Indy |
|
Penny |
(new 2006) 344 million records (32 GB) |
(2006)590 M records ( 55GB) |
|
Minute |
(new 2006) 40 GB (400 million records) |
( 2005) 116GB (125 M records) SCS pdf 58.7 seconds Linux, 80 Itanium2, 2,520 SAN disks Jim Wyllie, IBM Almaden Research |
|
TeraByte |
(2004) 33
minutes |
(2005) 435
seconds (7.25 minutes) Linux,
80 Itanium2, 2,520 SAN disks |
Data generator: SortGen.CPP is the source; SortGen.exe is the Windows/Intel
binary (uses stdio.h in C): SortGen.zip
is a Visual Studio project. Jim finally fixed it to handle more than 2 billion
records. This was not an issue till 2004.
Manual: SortGen #Records FileName
Validator: chkSort.cpp is the source, chkSort.exe is the Windows/Intel binary: chkSort.zip
Manual: chkSort InputFile SortedFile
checks that files have same checksum, same number of records, and that SortedFile is sorted in strnicmp() order.
Process:
· Trophies are awarded each year at ACM SIGMOD.
· Entrants can contact any previous winner and get their result "certified" by April 1.
· Entries must include a document describing the algorithm and the hardware in enough detail so that others could reproduce the result.
Frequently asked questions: FAQ
Ground rules:
· Must sort to and from operating system files on secondary storage.
· No raw disk benchmarks allowed since we are trying to test the IO subsystem.
· File or device striping (RAID 0) are allowed (encouraged) to get bandwidth. If file striping is used then the concatenated files must form a sorted file.
· The output file must be created as part of the sort.
· Time includes the launching of the sort program.
Original Sort Benchmark “A Measure of Transaction Processing Power ” With 25 others Datamation, V 31.7, April 1985, pp 112-118.
· Sort a million hundred-byte records
· It tests file system, IO system, and utilities. Originally, winners took 1 hour, now 1 second! So the benchmark is deprecated.
Penny and Minute Sort benchmarks RTF format, and HTML
Minute Sort:
· Sort as many records as you can in a minute
· Report rate and price ($cost/1e6)
Penny Sort:
· Sort as much as you can for a penny.
Two categories:
· Daytona (stock car): Sort code must be general purpose.
· Indy (formula 1): need only sort 100-byte records with 10-byte keys.
|
Past Winners |
||||||
|
|
Daytona |
Indy |
||||
|
Penny |
Year |
Size |
System/Group |
Year |
Size |
System/Group |
|
2005
2004
2000
1999
1998 |
15 GB (163 M records)
4.5 GB
2.6 GB
1.3 GB |
PostManSort,
doc pdf THsort
pdf, doc HMsort: doc (74KB),pdf (32KB). HMsort: PostmanSort/NT |
2005
2002
2000
1999
1998 |
40GB (433 M records)
4.5 GB
2.6 GB
1.5 GB |
SheenkSort.pdf
125 m records
(~12GB)
HMsort: 886 seconds on a $1010 Win2K/Intel system
Brad Helmkamp, Keith McCready, NTsort
/NT |
|
|
Minute |
Year |
Size |
System/Group |
Year |
Size |
System/Group |
|
2004
2000
1998 1997 1995 |
32 GB
5.8 GB 3.5 GB 1.1 GB |
340 million records Ordinal
Nsort Ordinal Nsort Alpha/Nyberg SGI/Nyberg |
2004
2000
1999
1998 1997 1995 |
32GB
21.8 GB
10.3 GB
8.41 GB 3.5 GB 1.08 GB |
Nsort pdf, word,
htm NOW+MPI
HPVMsort UC Berkeley NowSort Alpha/Nyberg SGI/Nyberg |
|
|
Terabyte |
year |
time |
Group |
Year |
Speed |
System/Group |
|
2000
1998 |
49 min
151 min |
Tandem FastSort Nsort |
2000
1998 |
18 min
151 min |
SPsort Nsort |
|
|
Datamation
|
The Datamation benchmark is now deprecated because it is so easy to sort a million records. |
Year |
Speed |
System/Group |
||
|
1987 1988 1993 1994 1996 1997 1999
2000
2001 |
980sec 28 sec 9 sec 7 sec 4.2 sec 2.4 sec 1.18 sec
.998 sec
.44 sec |
Tandem/Tsukerman Cray1/Weinberger Alpha/Nyberg Alpha/Nyberg SGI/Nyberg UltraSPARC/Arpaci-Dusseau Phillip Buonadonna,
Spencer Low, Josh Coates, Mitsubishi
DIAPRISM Hardware Sorter Datamation 2001: A Sorting Odyssey, |
||||