Are you over 18 and want to see adult content?
More Annotations
A complete backup of esnlithuania.org
Are you over 18 and want to see adult content?
A complete backup of mediameowster.com
Are you over 18 and want to see adult content?
A complete backup of nordsjoidedesign.se
Are you over 18 and want to see adult content?
A complete backup of spacialaudio.com
Are you over 18 and want to see adult content?
Favourite Annotations
Behindertengerechter Fahrzeugumbau - KADOMO GmbH
Are you over 18 and want to see adult content?
WoW Achievement Generator, Fake WoW Achievement
Are you over 18 and want to see adult content?
Жалюзи в Москве и России | Изготовление жалюзи на окна по размерам | Купить жалюзи в интернет-магазине FOROOM
Are you over 18 and want to see adult content?
Juvenilis.de - Nahrungsergänzung - Gesunde Ernährung - Kosmetik - Haarpflege - Makeup
Are you over 18 and want to see adult content?
Northwest Nazarene University - One of the Best Christian Colleges in the Northwest
Are you over 18 and want to see adult content?
A complete backup of aarproadside.com
Are you over 18 and want to see adult content?
Интернет магазин электроинструментов, самый широкий ассортимент инструментов в Казахстане
Are you over 18 and want to see adult content?
A complete backup of beautifulstores.com
Are you over 18 and want to see adult content?
Text
subscription ratio
SPSORT: HOW TO SORT A TERABYTE QUICKLY SPsort: How to Sort a Terabyte Quickly Jim Wyllie ( wyllie@almaden.ibm.com ) February 4, 1999 Abstract In December 1998, a 488 node IBM RS/6000 SP * sorted a terabyte of data (10 billion 100 byte records) in 17 minutes, 37 seconds. TENCENTSORT FINAL V16 !1 Abstract—Following the GraySort rules of sortbenchmark.org, this paper reports results of 100 TB in less than 100 sec ( 60.7 TB/ min) for the "Indy" GraySort, 44.8 TB/min for the "Daytona" Graysort , 55.3 TB for the "Indy" MinuteSort, and 36.9 TB for DEEPSORT: SCALABLE SORTING WITH HIGH EFFICIENCY SORT BENCHMARK 2014 1 DeepSort: Scalable Sorting with High Efficiency Zheng Liyand Juhan Leez Abstract—We designed a distributed sorting engine optimized for scalability and efficiency. CLOUDSORT: A TCO SORT BENCHMARK managed in-house data center for many companies. Thus, CloudSort today primarily highlights the efficacy (or deficiencies) of different cloud platforms rather than the TCO-efficiency of sort implementations.TRITONSORT 2014
Resource i2.8xlarge r3.4xlarge Physical Processor Intel Xeon E5-2670 v2 Intel Xeon E5-2670 v2 vCPU cores 32 16 Memory 244 GiB 122 GiB Networking 10 Gb/s 2 Gb/s 2000 KIOXIASORT: SORTING 1TB BY 89K JOULES 1500 KioxiaSort: Sorting 1TB by 89K Joules Shintaro Sano, Kioxia Corporation, shintarou.sano@kioxia.com Zaid Mahmoud, Princess Sumaya University for Technology, z.tobasy@gmail.com FAWNSORT: ENERGY-EFFICIENT SORTING OF 10GB, 100GB, AND 1TB FAWNSort: Energy-efficient Sorting of 10GB, 100GB, and 1TB Padmanabhan Pillai, Michael Kaminsky, Michael A. Kozuch, David G. Andersen Intel Labs, Carnegie Mellon University MINUTESORT WITH FLAT DATACENTER STORAGE MinuteSort with Flat Datacenter Storage Johnson Apacible, Rich Draves, Jeremy Elson, Jinliang Fan, Owen Hofmann, Jon Howell, Ed Nightingale,Reuben Olinksy, Yutaka Suzue SORT BENCHMARK HOME PAGE Datamation Sort. Metric: Amount of time to sort one million records (100 MB). This is the original sort benchmark, defined in A Measure of Transaction Processing Power With 25 others Datamation, V 31.7, April 1985, pp 112-118. Originally, winners took 1 hour, now 1 second! FUXISORT - SORT BENCHMARK 2 3134 machines 2 * Intel(R) Xeon(R) E5-2630@2.30GHz (6 cores per CPU) 96GB memory 12 * 2TB SATA hard drives 10Gb/s Ethernet, 3:1subscription ratio
SPSORT: HOW TO SORT A TERABYTE QUICKLY SPsort: How to Sort a Terabyte Quickly Jim Wyllie ( wyllie@almaden.ibm.com ) February 4, 1999 Abstract In December 1998, a 488 node IBM RS/6000 SP * sorted a terabyte of data (10 billion 100 byte records) in 17 minutes, 37 seconds. TENCENTSORT FINAL V16 !1 Abstract—Following the GraySort rules of sortbenchmark.org, this paper reports results of 100 TB in less than 100 sec ( 60.7 TB/ min) for the "Indy" GraySort, 44.8 TB/min for the "Daytona" Graysort , 55.3 TB for the "Indy" MinuteSort, and 36.9 TB for DEEPSORT: SCALABLE SORTING WITH HIGH EFFICIENCY SORT BENCHMARK 2014 1 DeepSort: Scalable Sorting with High Efficiency Zheng Liyand Juhan Leez Abstract—We designed a distributed sorting engine optimized for scalability and efficiency. CLOUDSORT: A TCO SORT BENCHMARK managed in-house data center for many companies. Thus, CloudSort today primarily highlights the efficacy (or deficiencies) of different cloud platforms rather than the TCO-efficiency of sort implementations.TRITONSORT 2014
Resource i2.8xlarge r3.4xlarge Physical Processor Intel Xeon E5-2670 v2 Intel Xeon E5-2670 v2 vCPU cores 32 16 Memory 244 GiB 122 GiB Networking 10 Gb/s 2 Gb/s 2000 KIOXIASORT: SORTING 1TB BY 89K JOULES 1500 KioxiaSort: Sorting 1TB by 89K Joules Shintaro Sano, Kioxia Corporation, shintarou.sano@kioxia.com Zaid Mahmoud, Princess Sumaya University for Technology, z.tobasy@gmail.com FAWNSORT: ENERGY-EFFICIENT SORTING OF 10GB, 100GB, AND 1TB FAWNSort: Energy-efficient Sorting of 10GB, 100GB, and 1TB Padmanabhan Pillai, Michael Kaminsky, Michael A. Kozuch, David G. Andersen Intel Labs, Carnegie Mellon University MINUTESORT WITH FLAT DATACENTER STORAGE MinuteSort with Flat Datacenter Storage Johnson Apacible, Rich Draves, Jeremy Elson, Jinliang Fan, Owen Hofmann, Jon Howell, Ed Nightingale,Reuben Olinksy, Yutaka Suzue FAWNSORT: ENERGY-EFFICIENT SORTING OF 10GB, 100GB, AND 1TB FAWNSort: Energy-efficient Sorting of 10GB, 100GB, and 1TB Padmanabhan Pillai, Michael Kaminsky, Michael A. Kozuch, David G. Andersen Intel Labs, Carnegie Mellon University OZSORT 2.0: SORTING UP TO 252GB FOR A PENNY OzSort 2.0: Sorting up to 252GB for a Penny Nikolas Askitis Software Developer and Consultant Department of Computer Science and SoftwareEngineering,
SORT FAQ
Output file is a sorted permutation of the input file (same checksum). It should be a sequential file, as seen by fopen ( ) and a linear seek or whatever other file manipulation verbs are native to your operating system. For GraySort, MinuteSort, and OZSORT: SORTING 100GB FOR LESS THAN 87KJOULES OzSort: Sorting 100GB for less than 87kJoules Ranjan Sinha Department of Computer Science and Software Engineering, The University of Melbourne. ozsort@csse.unimelb.edu.au FAWNSORT: ENERGY-EFFICIENT SORTING OF 10GB FAWNSort: Energy-efficient Sorting of 10GB Padmanabhan Pillai, Michael Kaminsky, Vijay Vasudevan, Lawrence Tan Michael A. KozuchDavid Andersen
INDY GRAY SORT AND INDY MINUTE SORT Indy Gray Sort and Indy Minute Sort Dasheng Jiang Baidu Inc. & Peking University July, 2014 Overview We have built a sorting system to improve performance of Indy Minute Sort and Indy Gray Sort MINUTESORT WITH FLAT DATACENTER STORAGE MinuteSort with Flat Datacenter Storage Johnson Apacible, Rich Draves, Jeremy Elson, Jinliang Fan, Owen Hofmann, Jon Howell, Ed Nightingale,Reuben Olinksy, Yutaka Suzue 2000 PERFORMANCE / PRICE SORT AND PENNYSORT 2000 PennySort and Performance/Price Sort 2 2000 Performance / Price Sort and PennySort Brad Helmkamp, Keith McCready, Stenograph LLC helmk@bigfoot.com keithmc@ix.netcom.com GRAYSORT ON APACHE SPARK BY DATABRICKS GraySort on Apache Spark by Databricks Reynold Xin, Parviz Deyhim, Ali Ghodsi, Xiangrui Meng, Matei Zaharia Databricks Inc. Apache Spark FLASHSORT: JOULESORT BENCHMARK ENTRY, 2010 DAYTONA 10 GB CLASS FlashSort: JouleSort Benchmark Entry, 2010 Daytona 10 GB class John D. Davis (Microsoft Research, john.d@microsoft.com) Suzanne Rivoire (Sonoma State University/Microsoft Research, suzanne.rivoire@sonoma.edu) SORT BENCHMARK HOME PAGE Datamation Sort. Metric: Amount of time to sort one million records (100 MB). This is the original sort benchmark, defined in A Measure of Transaction Processing Power With 25 others Datamation, V 31.7, April 1985, pp 112-118. Originally, winners took 1 hour, now 1 second! SPSORT: HOW TO SORT A TERABYTE QUICKLY SPsort: How to Sort a Terabyte Quickly Jim Wyllie ( wyllie@almaden.ibm.com ) February 4, 1999 Abstract In December 1998, a 488 node IBM RS/6000 SP * sorted a terabyte of data (10 billion 100 byte records) in 17 minutes, 37 seconds. TENCENTSORT FINAL V16 !1 Abstract—Following the GraySort rules of sortbenchmark.org, this paper reports results of 100 TB in less than 100 sec ( 60.7 TB/ min) for the "Indy" GraySort, 44.8 TB/min for the "Daytona" Graysort , 55.3 TB for the "Indy" MinuteSort, and 36.9 TB for FUXISORT - SORT BENCHMARK 2 3134 machines 2 * Intel(R) Xeon(R) E5-2630@2.30GHz (6 cores per CPU) 96GB memory 12 * 2TB SATA hard drives 10Gb/s Ethernet, 3:1subscription ratio
DEEPSORT: SCALABLE SORTING WITH HIGH EFFICIENCY SORT BENCHMARK 2014 1 DeepSort: Scalable Sorting with High Efficiency Zheng Liyand Juhan Leez Abstract—We designed a distributed sorting engine optimized for scalability and efficiency. TAICHISORT: ENERGY-EFFICIENT SORTING OF 1TB WITH NVME AND TaichiSort: Energy-efficient Sorting of 1TB with NVMe and Coffee Lake Ming Liu 1, Kaiyuan Zhang1, Simon Peter2, and Arvind Krishnamurthy1 1University of Washington 2The University of Texas at Austin 1Introduction This paper summarizes our submission for the 2019 1TB 2000 KIOXIASORT: SORTING 1TB BY 89K JOULES 1500 KioxiaSort: Sorting 1TB by 89K Joules Shintaro Sano, Kioxia Corporation, shintarou.sano@kioxia.com Zaid Mahmoud, Princess Sumaya University for Technology, z.tobasy@gmail.comTRITONSORT 2014
Resource i2.8xlarge r3.4xlarge Physical Processor Intel Xeon E5-2670 v2 Intel Xeon E5-2670 v2 vCPU cores 32 16 Memory 244 GiB 122 GiB Networking 10 Gb/s 2 Gb/s INDY GRAY SORT AND INDY MINUTE SORT Indy Gray Sort and Indy Minute Sort Dasheng Jiang Baidu Inc. & Peking University July, 2014 Overview We have built a sorting system to improve performance of Indy Minute Sort and Indy Gray Sort GRAYSORT ON APACHE SPARK BY DATABRICKS GraySort on Apache Spark by Databricks Reynold Xin, Parviz Deyhim, Ali Ghodsi, Xiangrui Meng, Matei Zaharia Databricks Inc. Apache Spark SORT BENCHMARK HOME PAGE Datamation Sort. Metric: Amount of time to sort one million records (100 MB). This is the original sort benchmark, defined in A Measure of Transaction Processing Power With 25 others Datamation, V 31.7, April 1985, pp 112-118. Originally, winners took 1 hour, now 1 second! SPSORT: HOW TO SORT A TERABYTE QUICKLY SPsort: How to Sort a Terabyte Quickly Jim Wyllie ( wyllie@almaden.ibm.com ) February 4, 1999 Abstract In December 1998, a 488 node IBM RS/6000 SP * sorted a terabyte of data (10 billion 100 byte records) in 17 minutes, 37 seconds. TENCENTSORT FINAL V16 !1 Abstract—Following the GraySort rules of sortbenchmark.org, this paper reports results of 100 TB in less than 100 sec ( 60.7 TB/ min) for the "Indy" GraySort, 44.8 TB/min for the "Daytona" Graysort , 55.3 TB for the "Indy" MinuteSort, and 36.9 TB for FUXISORT - SORT BENCHMARK 2 3134 machines 2 * Intel(R) Xeon(R) E5-2630@2.30GHz (6 cores per CPU) 96GB memory 12 * 2TB SATA hard drives 10Gb/s Ethernet, 3:1subscription ratio
DEEPSORT: SCALABLE SORTING WITH HIGH EFFICIENCY SORT BENCHMARK 2014 1 DeepSort: Scalable Sorting with High Efficiency Zheng Liyand Juhan Leez Abstract—We designed a distributed sorting engine optimized for scalability and efficiency. TAICHISORT: ENERGY-EFFICIENT SORTING OF 1TB WITH NVME AND TaichiSort: Energy-efficient Sorting of 1TB with NVMe and Coffee Lake Ming Liu 1, Kaiyuan Zhang1, Simon Peter2, and Arvind Krishnamurthy1 1University of Washington 2The University of Texas at Austin 1Introduction This paper summarizes our submission for the 2019 1TB 2000 KIOXIASORT: SORTING 1TB BY 89K JOULES 1500 KioxiaSort: Sorting 1TB by 89K Joules Shintaro Sano, Kioxia Corporation, shintarou.sano@kioxia.com Zaid Mahmoud, Princess Sumaya University for Technology, z.tobasy@gmail.comTRITONSORT 2014
Resource i2.8xlarge r3.4xlarge Physical Processor Intel Xeon E5-2670 v2 Intel Xeon E5-2670 v2 vCPU cores 32 16 Memory 244 GiB 122 GiB Networking 10 Gb/s 2 Gb/s INDY GRAY SORT AND INDY MINUTE SORT Indy Gray Sort and Indy Minute Sort Dasheng Jiang Baidu Inc. & Peking University July, 2014 Overview We have built a sorting system to improve performance of Indy Minute Sort and Indy Gray Sort GRAYSORT ON APACHE SPARK BY DATABRICKS GraySort on Apache Spark by Databricks Reynold Xin, Parviz Deyhim, Ali Ghodsi, Xiangrui Meng, Matei Zaharia Databricks Inc. Apache Spark FAWNSORT: ENERGY-EFFICIENT SORTING OF 10GB, 100GB, AND 1TB FAWNSort: Energy-efficient Sorting of 10GB, 100GB, and 1TB Padmanabhan Pillai, Michael Kaminsky, Michael A. Kozuch, David G. Andersen Intel Labs, Carnegie Mellon UniversitySORT FAQ
Output file is a sorted permutation of the input file (same checksum). It should be a sequential file, as seen by fopen ( ) and a linear seek or whatever other file manipulation verbs are native to your operating system. For GraySort, MinuteSort, and OZSORT 2.0: SORTING UP TO 252GB FOR A PENNY OzSort 2.0: Sorting up to 252GB for a Penny Nikolas Askitis Software Developer and Consultant Department of Computer Science and SoftwareEngineering,
TRITONSORT 2014
Resource i2.8xlarge r3.4xlarge Physical Processor Intel Xeon E5-2670 v2 Intel Xeon E5-2670 v2 vCPU cores 32 16 Memory 244 GiB 122 GiB Networking 10 Gb/s 2 Gb/s OZSORT: SORTING OVER 246GB FOR A PENNY OzSort: Sorting over 246GB for a Penny Nikolas Askitis Department of Computer Science and Software Engineering The University of Melbourne. ozsort@csse.unimelb.edu.au OZSORT: SORTING 100GB FOR LESS THAN 87KJOULES OzSort: Sorting 100GB for less than 87kJoules Ranjan Sinha Department of Computer Science and Software Engineering, The University of Melbourne. ozsort@csse.unimelb.edu.au FAWNSORT: ENERGY-EFFICIENT SORTING OF 10GB FAWNSort: Energy-efficient Sorting of 10GB Padmanabhan Pillai, Michael Kaminsky, Vijay Vasudevan, Lawrence Tan Michael A. KozuchDavid Andersen
QIAN WANG NANJING UNIVERSITY DATABRICKS INC. MAP STAGE different mappers, merging the received data and writing them to attached disks. 3.4 Shuffle Stage In a normal map-reduce model of Apache Spark, it uses pull-based shuffle, which means storing the WINNING A 60 SECOND DASH WITH A YELLOW ELEPHANT Winning a 60 Second Dash with a Yellow Elephant Owen O’Malley and Arun C. Murthy Yahoo! owen@yahoo-inc.com and acm@yahoo-inc.com April 2009 Apache Hadoop is a open source software framework thatdramatically sim-
NTOSORT
1 NTOSort Andreas Ebert Vienna, Austria April, 2013 Abstract In this paper, I present the results of my submission to the 2013 edition ofthe sort contest.
SORT BENCHMARK HOME PAGE Datamation Sort. Metric: Amount of time to sort one million records (100 MB). This is the original sort benchmark, defined in A Measure of Transaction Processing Power With 25 others Datamation, V 31.7, April 1985, pp 112-118. Originally, winners took 1 hour, now 1 second! SPSORT: HOW TO SORT A TERABYTE QUICKLY SPsort: How to Sort a Terabyte Quickly Jim Wyllie ( wyllie@almaden.ibm.com ) February 4, 1999 Abstract In December 1998, a 488 node IBM RS/6000 SP * sorted a terabyte of data (10 billion 100 byte records) in 17 minutes, 37 seconds. TENCENTSORT FINAL V16 !1 Abstract—Following the GraySort rules of sortbenchmark.org, this paper reports results of 100 TB in less than 100 sec ( 60.7 TB/ min) for the "Indy" GraySort, 44.8 TB/min for the "Daytona" Graysort , 55.3 TB for the "Indy" MinuteSort, and 36.9 TB for FUXISORT - SORT BENCHMARK 2 3134 machines 2 * Intel(R) Xeon(R) E5-2630@2.30GHz (6 cores per CPU) 96GB memory 12 * 2TB SATA hard drives 10Gb/s Ethernet, 3:1subscription ratio
DEEPSORT: SCALABLE SORTING WITH HIGH EFFICIENCY SORT BENCHMARK 2014 1 DeepSort: Scalable Sorting with High Efficiency Zheng Liyand Juhan Leez Abstract—We designed a distributed sorting engine optimized for scalability and efficiency. TAICHISORT: ENERGY-EFFICIENT SORTING OF 1TB WITH NVME AND TaichiSort: Energy-efficient Sorting of 1TB with NVMe and Coffee Lake Ming Liu 1, Kaiyuan Zhang1, Simon Peter2, and Arvind Krishnamurthy1 1University of Washington 2The University of Texas at Austin 1Introduction This paper summarizes our submission for the 2019 1TB 2000 KIOXIASORT: SORTING 1TB BY 89K JOULES 1500 KioxiaSort: Sorting 1TB by 89K Joules Shintaro Sano, Kioxia Corporation, shintarou.sano@kioxia.com Zaid Mahmoud, Princess Sumaya University for Technology, z.tobasy@gmail.comTRITONSORT 2014
Resource i2.8xlarge r3.4xlarge Physical Processor Intel Xeon E5-2670 v2 Intel Xeon E5-2670 v2 vCPU cores 32 16 Memory 244 GiB 122 GiB Networking 10 Gb/s 2 Gb/s INDY GRAY SORT AND INDY MINUTE SORT Indy Gray Sort and Indy Minute Sort Dasheng Jiang Baidu Inc. & Peking University July, 2014 Overview We have built a sorting system to improve performance of Indy Minute Sort and Indy Gray Sort GRAYSORT ON APACHE SPARK BY DATABRICKS GraySort on Apache Spark by Databricks Reynold Xin, Parviz Deyhim, Ali Ghodsi, Xiangrui Meng, Matei Zaharia Databricks Inc. Apache Spark SORT BENCHMARK HOME PAGE Datamation Sort. Metric: Amount of time to sort one million records (100 MB). This is the original sort benchmark, defined in A Measure of Transaction Processing Power With 25 others Datamation, V 31.7, April 1985, pp 112-118. Originally, winners took 1 hour, now 1 second! SPSORT: HOW TO SORT A TERABYTE QUICKLY SPsort: How to Sort a Terabyte Quickly Jim Wyllie ( wyllie@almaden.ibm.com ) February 4, 1999 Abstract In December 1998, a 488 node IBM RS/6000 SP * sorted a terabyte of data (10 billion 100 byte records) in 17 minutes, 37 seconds. TENCENTSORT FINAL V16 !1 Abstract—Following the GraySort rules of sortbenchmark.org, this paper reports results of 100 TB in less than 100 sec ( 60.7 TB/ min) for the "Indy" GraySort, 44.8 TB/min for the "Daytona" Graysort , 55.3 TB for the "Indy" MinuteSort, and 36.9 TB for FUXISORT - SORT BENCHMARK 2 3134 machines 2 * Intel(R) Xeon(R) E5-2630@2.30GHz (6 cores per CPU) 96GB memory 12 * 2TB SATA hard drives 10Gb/s Ethernet, 3:1subscription ratio
DEEPSORT: SCALABLE SORTING WITH HIGH EFFICIENCY SORT BENCHMARK 2014 1 DeepSort: Scalable Sorting with High Efficiency Zheng Liyand Juhan Leez Abstract—We designed a distributed sorting engine optimized for scalability and efficiency. TAICHISORT: ENERGY-EFFICIENT SORTING OF 1TB WITH NVME AND TaichiSort: Energy-efficient Sorting of 1TB with NVMe and Coffee Lake Ming Liu 1, Kaiyuan Zhang1, Simon Peter2, and Arvind Krishnamurthy1 1University of Washington 2The University of Texas at Austin 1Introduction This paper summarizes our submission for the 2019 1TB 2000 KIOXIASORT: SORTING 1TB BY 89K JOULES 1500 KioxiaSort: Sorting 1TB by 89K Joules Shintaro Sano, Kioxia Corporation, shintarou.sano@kioxia.com Zaid Mahmoud, Princess Sumaya University for Technology, z.tobasy@gmail.comTRITONSORT 2014
Resource i2.8xlarge r3.4xlarge Physical Processor Intel Xeon E5-2670 v2 Intel Xeon E5-2670 v2 vCPU cores 32 16 Memory 244 GiB 122 GiB Networking 10 Gb/s 2 Gb/s INDY GRAY SORT AND INDY MINUTE SORT Indy Gray Sort and Indy Minute Sort Dasheng Jiang Baidu Inc. & Peking University July, 2014 Overview We have built a sorting system to improve performance of Indy Minute Sort and Indy Gray Sort GRAYSORT ON APACHE SPARK BY DATABRICKS GraySort on Apache Spark by Databricks Reynold Xin, Parviz Deyhim, Ali Ghodsi, Xiangrui Meng, Matei Zaharia Databricks Inc. Apache Spark FAWNSORT: ENERGY-EFFICIENT SORTING OF 10GB, 100GB, AND 1TB FAWNSort: Energy-efficient Sorting of 10GB, 100GB, and 1TB Padmanabhan Pillai, Michael Kaminsky, Michael A. Kozuch, David G. Andersen Intel Labs, Carnegie Mellon UniversitySORT FAQ
Output file is a sorted permutation of the input file (same checksum). It should be a sequential file, as seen by fopen ( ) and a linear seek or whatever other file manipulation verbs are native to your operating system. For GraySort, MinuteSort, and OZSORT 2.0: SORTING UP TO 252GB FOR A PENNY OzSort 2.0: Sorting up to 252GB for a Penny Nikolas Askitis Software Developer and Consultant Department of Computer Science and SoftwareEngineering,
OZSORT: SORTING OVER 246GB FOR A PENNY OzSort: Sorting over 246GB for a Penny Nikolas Askitis Department of Computer Science and Software Engineering The University of Melbourne. ozsort@csse.unimelb.edu.auTRITONSORT 2014
Resource i2.8xlarge r3.4xlarge Physical Processor Intel Xeon E5-2670 v2 Intel Xeon E5-2670 v2 vCPU cores 32 16 Memory 244 GiB 122 GiB Networking 10 Gb/s 2 Gb/s OZSORT: SORTING 100GB FOR LESS THAN 87KJOULES OzSort: Sorting 100GB for less than 87kJoules Ranjan Sinha Department of Computer Science and Software Engineering, The University of Melbourne. ozsort@csse.unimelb.edu.au FAWNSORT: ENERGY-EFFICIENT SORTING OF 10GB FAWNSort: Energy-efficient Sorting of 10GB Padmanabhan Pillai, Michael Kaminsky, Vijay Vasudevan, Lawrence Tan Michael A. KozuchDavid Andersen
QIAN WANG NANJING UNIVERSITY DATABRICKS INC. MAP STAGE different mappers, merging the received data and writing them to attached disks. 3.4 Shuffle Stage In a normal map-reduce model of Apache Spark, it uses pull-based shuffle, which means storing the MINUTESORT WITH FLAT DATACENTER STORAGE MinuteSort with Flat Datacenter Storage Johnson Apacible, Rich Draves, Jeremy Elson, Jinliang Fan, Owen Hofmann, Jon Howell, Ed Nightingale,Reuben Olinksy, Yutaka Suzue WINNING A 60 SECOND DASH WITH A YELLOW ELEPHANT Winning a 60 Second Dash with a Yellow Elephant Owen O’Malley and Arun C. Murthy Yahoo! owen@yahoo-inc.com and acm@yahoo-inc.com April 2009 Apache Hadoop is a open source software framework thatdramatically sim-
SORT BENCHMARK HOME PAGE ------------------------- _NEW:_ We are happy to announce the 2019 winners listed below. The new, 2019 records are listed in green. Congratulations to the winners!BACKGROUND
Until 2007, the sort benchmarks were primary defined, sponsored and administered by Jim Gray. Following Jim's disappearance at sea in January 2007, the sort benchmarks have been continued by a committee of past colleagues and sort benchmark winners. The Sort Benchmark committee members include: * Chris Nyberg of Ordinal Technology Corp * Mehul Shah of Amazon Web Services * Naga Govindaraju of MicrosoftTop Results
DAYTONA
INDY
Gray
2016, 44.8 TB/min
Tencent Sort
100 TB in 134 Seconds 512 nodes x (2 OpenPOWER 10-core POWER8 2.926 GHz, 512 GB memory, 4x Huawei ES3600P V3 1.2TB NVMe SSD, 100Gb Mellanox ConnectX4-EN) Jie Jiang, Lixiong Zheng, Junfeng Pu, Xiong Cheng, Chongqing ZhaoTencent Corporation
Mark R. Nutter, Jeremy D. Schaub2016, 60.7 TB/min
Tencent Sort
100 TB in 98.8 Seconds 512 nodes x (2 OpenPOWER 10-core POWER8 2.926 GHz, 512 GB memory, 4x Huawei ES3600P V3 1.2TB NVMe SSD, 100Gb Mellanox ConnectX4-EN) Jie Jiang, Lixiong Zheng, Junfeng Pu, Xiong Cheng, Chongqing ZhaoTencent Corporation
Mark R. Nutter, Jeremy D. SchaubCloud
2016, $1.44 / TB
NADSort
100 TB for $144
394 Alibaba Cloud ECS ecs.n1.large nodes x (Haswell E5-2680 v3, 8 GB memory, 40GB Ultra Cloud Disk, 4x 135GB SSD Cloud Disk) Qian Wang, Rong Gu, Yihua HuangNanjing University
Reynold Xin
Databricks Inc.
Wei Wu, Jun Song, Junluan XiaAlibaba Group Inc.
2016, $1.44 / TB
NADSort
100 TB for $144
394 Alibaba Cloud ECS ecs.n1.large nodes x (Haswell E5-2680 v3, 8 GB memory, 40GB Ultra Cloud Disk, 4x 135GB SSD Cloud Disk) Qian Wang, Rong Gu, Yihua HuangNanjing University
Reynold Xin
Databricks Inc.
Wei Wu, Jun Song, Junluan XiaAlibaba Group Inc.
Minute
2016, 37 TB
Tencent Sort
512 nodes x (2 OpenPOWER 10-core POWER8 2.926 GHz, 512 GB memory, 4x Huawei ES3600P V3 1.2TB NVMe SSD, 100Gb Mellanox ConnectX4-EN) Jie Jiang, Lixiong Zheng, Junfeng Pu, Xiong Cheng, Chongqing ZhaoTencent Corporation
Mark R. Nutter, Jeremy D. Schaub2016, 55 TB
Tencent Sort
512 nodes x (2 OpenPOWER 10-core POWER8 2.926 GHz, 512 GB memory, 4x Huawei ES3600P V3 1.2TB NVMe SSD, 100Gb Mellanox ConnectX4-EN) Jie Jiang, Lixiong Zheng, Junfeng Pu, Xiong Cheng, Chongqing ZhaoTencent Corporation
Mark R. Nutter, Jeremy D. SchaubJoule
1010 recs
2-way tie:
2019, 163 KJoules
TaichiSort
61 K records sorted / joule Intel i7-9700, 32GB RAM, Nsort, Ubuntu 16.04.3 LTS, 2 Intel DC 3600 series PCIe NVMe SSD (1.2 TB), 1 Intel DC 3600 series PCIe NVMe SSD (2.0 TB) Ming Liu, Kaiyuan Zhang, Arvind Krishnamurthy University of WashingtonSimon Peter
University of Texas at Austin2013, 168 KJoules
NTOSort
59 K records sorted / joule Intel i7-3770K, 16GB RAM, Nsort, Windows 8, 16 Samsung 840 Pro 256GB SSDs, 1 Samsung 840 Pro 128GB SSDAndreas Ebert
Microsoft
2019, 89 KJoules
KioxiaSort
112 K records sorted / joule Intel i9-9900K, 64GB RAM, Ubuntu 19.04 Server, 8 CFD CSSD-M2B1TPG3VNF (1TB), 1 Toshiba XG5-P KXG50PNV2T04 (2TB) Shintaro Sano, Tomoya SuzukiKioxia Corporation
Zaid Mahmoud
Princess Sumaya University for TechnologyCOMMON RULES
All the sort benchmarks share the following ground rules: * Must sort to and from operating system files on secondary storage. * No raw disk usage allowed since we are trying to test the IOsubsystem.
* File or device striping (RAID 0) are allowed (encouraged) to get bandwidth. If file striping is used then the concatenated files mustform a sorted file.
* The output file must be created as part of the sort. * Time includes the launching of the sort program. * The sort input records must be 100 bytes in length, with the first 10 bytes being a random key. * Use the gensort record generator to create the input records. * The sort output file must be validated for correct key order andchecksum.
* The hardware used should be commercially available (off-the-shelf), and unmodified (e.g. no processor over or under clocking).SORT BENCHMARKS
GraySort
METRIC: Sort rate (TBs / minute) achieved while sorting a very large amount of data (currently 100 TB minimum).CloudSort
METRIC: Minimum cost for sorting a very large amount of data on a public cloud. (currently 100 TB). Complete rules in the CloudSortshort
paper.
MinuteSort
METRIC: Amount of data that can be sorted in 60.00 seconds or less. Originally defined in AlphaSortpaper.
JouleSort
METRIC: Amount of energy required to sort 108, 109, 1010, or 1012 records (10 GB, 100 GB, 1 TB, or 100TB). Originally defined in JouleSortpaper.
The 108, 109 and 1012 records JouleSort benchmarks are nowdeprecated.
PennySort
METRIC: Amount of data that can be sorted for a penny's worth ofsystem time.
Originally defined in AlphaSortpaper.
PennySort is now deprecated.TeraByte Sort
METRIC: Elapsed time to sort 1012 bytes of data. The TeraByte benchmark is now deprecated because it became essentially the same as MinuteSort.Datamation Sort
METRIC: Amount of time to sort one million records (100 MB). This is the original sort benchmark, defined in A Measure of Transaction Processing Power With 25 others Datamation, V 31.7, April1985, pp 112-118.
Originally, winners took 1 hour, now 1 second! So the benchmark isdeprecated.
BENCHMARK CATEGORIES For each sort benchmark, there are two categories:DAYTONA (STOCK CAR)
INDY (FORMULA 1)
Sort code must be general purpose. Need only sort 100-byte records with 10-byte keys.COMPLETE RULES
The 2019 rules are currently being adjusted. For the previous version of the detailed rules, see the frequently asked questions (FAQ).
PROCESS
Entries must include a document describing the algorithm and the hardware in enough detail so that others could reproduce the result. Click on the title of any previous winning sort to view sort description document.NEW ENTRIES
The submission deadline for the 2019 contest is 1 September 2019.Past Winners
DAYTONA
INDY
Gray
2015, 15.9 TB/min
FuxiSort
100 TB in 377 seconds 3,134 nodes x (2 Xeon E5-2630 2.30Ghz, 96 GB memory, 12x2 TB SATA HD, 10 Gb/s Ethernet) + 243 nodes x (2 Xeon E5-2650v2 2.60Ghz, 128 GB memory, 12x2 TB SATA HD, 10 Gb/s Ethernet) Jiamang Wang, Yongjun Wu, Hua Cai, Zhipeng Tang, Zhiqiang Lv, Bin Lu, Yangyu Tao, Chao Li, Jingren Zhou, Hong TangAlibaba Group Inc
2014, 4.35 TB/min
TritonSort
100 TB in 1,378 seconds 186 Amazon EC2 i2.8xlarge nodes x (32 vCores - 2.50Ghz Intel Xeon E5-2670 v2, 244GB memory, 8x800 GBSSD)
Michael Conley, Amin Vahdat,George Porter
University of California, San Diego2014, 4.27 TB/min
Apache Spark
100 TB in 1,406 seconds 207 Amazon EC2 i2.8xlarge nodes x (32 vCores - 2.5Ghz Intel Xeon E5-2670 v2, 244GB memory, 8x800 GB SSD) Reynold Xin, Parviz Deyhim, Xiangrui Meng, Ali Ghodsi, Matei ZahariaDatabricks
2013, 1.42 TB/min
Hadoop
102.5 TB in 4,328 seconds2100 nodes x
(2 2.3Ghz hexcore Xeon E5-2630, 64 GB memory, 12x3TB disks)Thomas Graves
Yahoo! Inc.
2011, 0.725 TB/min
TritonSort
100 TB in 8,274 seconds52 nodes x
(2 Quadcore processors, 24 GB memory, 16x500GB disks) Cisco Nexus 5096 switch Alex Rasmussen, Michael Conley, George Porter, Amin Vahdat, University of California, San Diego2009, 0.578 TB/min
Hadoop
100 TB in 173 minutes 3452 nodes x (2 Quadcore Xeons, 8 GB memory, 4 SATA) Owen O'Malley and Arun MurthyYahoo Inc.
2015, 18.2 TB/min
FuxiSort
100 TB in 329 seconds 3,134 nodes x (2 Xeon E5-2630 2.30Ghz, 96 GB memory, 12x2 TB SATA HD, 10 Gb/s Ethernet) + 243 nodes x (2 Xeon E5-2650v2 2.60Ghz, 128 GB memory, 12x2 TB SATA HD, 10 Gb/s Ethernet) Jiamang Wang, Yongjun Wu, Hua Cai, Zhipeng Tang, Zhiqiang Lv, Bin Lu, Yangyu Tao, Chao Li, Jingren Zhou, Hong TangAlibaba Group Inc
2014, 8.38 TB/min
BaiduSort
100 TB in 716 seconds982 nodes x
(2 2.10Ghz Intel Xeon E5-2450, 192 GB memory, 8x3TB 7200 RPM SATA)Dasheng Jiang
Baidu Inc. and Peking University2013, 1.42 TB/min
Hadoop
102.5 TB in 4,328 seconds2100 nodes x
(2 2.3Ghz hexcore Xeon E5-2630, 64 GB memory, 12x3TB disks)Thomas Graves
Yahoo! Inc.
2011, 0.938 TB/min
TritonSort
100 TB in 6,395 seconds52 nodes x
(2 Quadcore processors, 24 GB memory, 16x500GB disks) Cisco Nexus 5096 switch Alex Rasmussen, Michael Conley, George Porter, Amin Vahdat, University of California, San Diego2010, 0.582 TB/min
TritonSort
100 TB in 10,318 seconds47 nodes x
(2 Quadcore processors, 24 GB memory, 16x500GB disks) Cisco Nexus 5020 switch Alex Rasmussen, Radhika NiranjanMysore,
Harsha V. Madhyastha, MichaelConley,
George Porter, Amin Vahdat, University of California, San DiegoAlexander Pucher
Vienna University of Technology2009, 0.564 TB/min
DEMSort
100 TB in 10,628 seconds195 nodes x
(2 Quadcore processors, 16 GB memory, 4x250GB disks) 288-port InfiniBand 4xDDR switch Mirko Rahn, Peter Sanders, Johannes Singler andTim Kieritz
Karlsruhe Institute of Technology, GermanyCloud
2014, $4.51 / TB
TritonSort
100 TB for $451
330 Amazon EC2 r3.4xlarge nodes x (16 vCores - 2.50Ghz Intel Xeon E5-2670 v2, 122 GB memory, 320GB SSD,8x135GB EBS gp2)
Michael Conley, Amin Vahdat,George Porter
University of California, San Diego2014, $4.51 / TB
TritonSort
100 TB for $451
330 Amazon EC2 r3.4xlarge nodes x (16 vCores - 2.50Ghz Intel Xeon E5-2670 v2, 122 GB memory, 320GB SSD,8x135GB EBS gp2)
Michael Conley, Amin Vahdat,George Porter
University of California, San DiegoMinute
2015, 7.7 TB
FuxiSort
3,134 nodes x (2 Xeon E5-2630 2.30Ghz, 96 GB memory, 12x2 TB SATA HD, 10 Gb/s Ethernet) + 243 nodes x (2 Xeon E5-2650v2 2.60Ghz, 128 GB memory, 12x2 TB SATA HD, 10 Gb/s Ethernet) Jiamang Wang, Yongjun Wu, Hua Cai, Zhipeng Tang, Zhiqiang Lv, Bin Lu, Yangyu Tao, Chao Li, Jingren Zhou, Hong TangAlibaba Group Inc
2014, 3.7 TB
DeepSort
384 nodes x
(2 2.10Ghz Intel Xeon hexa-core, 64 GB memory, 8 7200 RPM hard drives)Zheng Li, Juhan Lee
Samsung
2012, 1,401 GB
Flat Datacenter Storage 256 heterogeneous nodes, 1033 disks Johnson Apacible, Rich Draves, Jeremy Elson, Jinliang Fan, Owen Hofmann, Jon Howell, Ed Nightingale, Reuben Olinksy, Yutaka SuzueMicrosoft Research
2009, 500 GB
Hadoop
1406 nodes x (2 Quadcore Xeons, 8 GB memory, 4 SATA) Owen O'Malley and Arun MurthyYahoo Inc.
2007, 214 GB
TokuSampleSort
tx2500 disk cluster
400 nodes x (2 processors, 6-disk RAID, 8 GB memory) Bradley C. Kuszmaul, MIT2006, 40 GB
NeoSort
Windows, Fujitsu 32 Itanium2, 128 SAN disks Chris Nyberg, Charles Koester Ordinal Technology Corp2004, 34 GB
Nsort
Windows, 32 Itanium2, 2,350 disks Chris Nyberg, Charles KoesterOrdinal
2000, 12 GB
Nsort
SGI 32 cpu Origin IRIX1998, 5.8 GB
Nsort
SGI 32 cpu Origin IRIX1997, 3.5 GB
Nsort
IRIX Challenge
Ordinal Technology Corp1995, 1.1 GB
AlphaSort
Nyberg
2015, 11 TB
FuxiSort
3,134 nodes x (2 Xeon E5-2630 2.30Ghz, 96 GB memory, 12x2 TB SATA HD, 10 Gb/s Ethernet) + 243 nodes x (2 Xeon E5-2650v2 2.60Ghz, 128 GB memory, 12x2 TB SATA HD, 10 Gb/s Ethernet) Jiamang Wang, Yongjun Wu, Hua Cai, Zhipeng Tang, Zhiqiang Lv, Bin Lu, Yangyu Tao, Chao Li, Jingren Zhou, Hong TangAlibaba Group Inc
2014, 7.0 TB
BaiduSort
993 nodes x
(2 2.10Ghz Intel Xeon E5-2450, 192 GB memory, 8x3TB 7200 RPM SATA)Dasheng Jiang
Baidu Inc. and Peking University2012, 1,470 GB
Flat Datacenter Storage 256 heterogeneous nodes, 1033 disks Johnson Apacible, Rich Draves, Jeremy Elson, Jinliang Fan, Owen Hofmann, Jon Howell, Ed Nightingale, Reuben Olinksy, Yutaka SuzueMicrosoft Research
2011, 1353GB
TritonSort
52 nodes x
(2 Quadcore processors, 24 GB memory, 16x500GB disks) Cisco Nexus 5096 switch Alex Rasmussen, Michael Conley, George Porter, Amin Vahdat, University of California, San Diego2010, 1014 GB
TritonSort
52 nodes x
(2 Quadcore processors, 24 GB memory, 16x500GB disks) Cisco Nexus 5020 switch Alex Rasmussen, Radhika NiranjanMysore,
Harsha V. Madhyastha, MichaelConley,
George Porter, Amin Vahdat, University of California, San DiegoAlexander Pucher
Vienna University of Technology2009, 955 GB
DEMSort
195 nodes x
(2 Quadcore processors, 16 GB memory, 4x250GB disks) 288-port InfiniBand 4xDDR switch Mirko Rahn, Peter Sanders, Johannes Singler andTim Kieritz
Karlsruhe Institute of Technology, Germany2007, 264 GB
TokuSampleSort
tx2500 disk cluster
400 nodes x (2 processors, 6-disk RAID, 8 GB memory) Bradley C. Kuszmaul, MIT2005, 125 GB
SCS
Linux, 80 Itanium2, 2,520 SAN disks Jim Wyllie, IBM Almaden Research2004, 32 GB
Nsort
32 x Itanium2 WinServer Chris Nyberg, Charles KoesterOrdinal Technology
2000, 21.8 GB
NOW+HPVMsort
64 nodes WinNT
Luis Rivera, Xianan Zhang, Andrew ChienUCSD
1999, 10,3 GB
NOW+MPI HPVMsort
Luis Rivera, UIUC
Andrew Chien, UCSD
1998, 8.41 GB
NowSort
95 UltraSparc + MyrinetSolaris UC Berkeley1997, 3.5 GB
Nsort
SGI/Nyberg,Koester
Nsort/Irix/Challenge1995, 1.08 GB
AlphaSort
Nyberg
Joule
108 recs
(deprecated)
2013, 889 Joules
NTOSort
112,545 records sorted / joule Lenovo X220, 2.8 Ghz Intel i5-2640M, 16GB RAM, Nsort, Windows 8, 1 OCZ 120GB mSATA Nocti SSD, 2 Samsung 840 Pro 256GB SSDsAndreas Ebert
Microsoft
2012, 1,393 Joules
FAWNSort
71,800 records sorted / joule Intel Core i7-2700K 3.5 GHz, 16GB RAM, Nsort, 16 x 300 GB Intel 710 Series SSDs, 1 160 GB Intel 510 Series SSDPadmanabhan Pillai
, Michael
Kaminsky ,
Michael A. Kozuch
,
Intel Labs PittsburghDavid Andersen
Carnegie Mellon University2011, 1,430 Joules
FAWNSort
69,900 records sorted / joule Intel Core i5-2400S 2.5 GHz, 16GB RAM, Nsort, 7 x 120 GB Intel 510 Series SSDsPadmanabhan Pillai
, Michael
Kaminsky ,
Michael A. Kozuch
,
Intel Labs Pittsburgh Vijay Vasudevan , Lawrence Tan, DavidAndersen
Carnegie Mellon University2010, 2.2 KJoules
FAWNSort
44,900 records sorted / joule Intel Xeon L3426 1.86GHz, 12GB RAM, Nsort, Fusion-io ioDrive (80GB), 4 x Intel X25-E (3 x 32GB, 1 x 64GB) Vijay Vasudevan , Lawrence Tan, DavidAndersen
Carnegie Mellon UniversityMichael Kaminsky
, Michael
A. Kozuch ,
Padmanabhan Pillai
Intel Labs Pittsburgh 2010 Jan 1, 4.0 KJoulesFlashSort
24,800 records sorted / joule Quad Core AMD Opteron 2373 2.01GHz, 16GB RAM80GB FusionIO
John D. Davis (Microsoft Research) Suzanne Rivoire (Sonoma State University)2007, 8.6 KJoules
CoolSort
11,600 records sorted / joule Mobile Core 2 Duo, 13 SATA laptop disks, 2GB RAM, Nsort Suzanne Rivoire (Stanford), MehulA. Shah (HP
Labs),
Partha Ranganathan
(HP
Labs), Christos Kozyrakis(Stanford)
2013, 889 Joules
NTOSort
112,545 records sorted / joule Lenovo X220, 2.8 Ghz Intel i5-2640M, 16GB RAM, Nsort, Windows 8, 1 OCZ 120GB mSATA Nocti SSD, 2 Samsung 840 Pro 256GB SSDsAndreas Ebert
Microsoft
2012, 1,393 Joules
FAWNSort
71,800 records sorted / joule Intel Core i7-2700K 3.5 GHz, 16GB RAM, Nsort, 16 x 300 GB Intel 710 Series SSDs, 1 160 GB Intel 510 Series SSDPadmanabhan Pillai
, Michael
Kaminsky ,
Michael A. Kozuch
,
Intel Labs PittsburghDavid Andersen
Carnegie Mellon University2011, 1,430 Joules
FAWNSort
69,900 records sorted / joule Intel Core i5-2400S 2.5 GHz, 16GB RAM, Nsort, 7 x 120 GB Intel 510 Series SSDsPadmanabhan Pillai
, Michael
Kaminsky ,
Michael A. Kozuch
,
Intel Labs Pittsburgh Vijay Vasudevan , Lawrence Tan, DavidAndersen
Carnegie Mellon University2010, 2.2 KJoules
FAWNSort
44,900 records sorted / joule Intel Xeon L3426 1.86GHz, 12GB RAM, Nsort, Fusion-io ioDrive (80GB), 4 x Intel X25-E (3 x 32GB, 1 x 64GB) Vijay Vasudevan , Lawrence Tan, DavidAndersen
Carnegie Mellon UniversityMichael Kaminsky
, Michael
A. Kozuch ,
Padmanabhan Pillai
Intel Labs Pittsburgh2010, 2.3 KJoules
EcoSort
42,600 records sorted / joule Intel Atom 330 1.6GHz, 4GB RAM, 4 x Super Talent UltraDrive GX MLC 256GBAndreas Beckmann ,
Ulrich Meyer
Goethe University Frankfurt am Main, Germany Peter Sanders, JohannesSingler
Karlsruhe Institute of Technology, Germany 2010 Jan 1, 2.8 KJoulesEcoSort
35,500 records sorted / joule Intel Atom 330 1.6GHz, 4GB RAM, 4 x SuperTalent UltraDrive GX MLC 256GBAndreas Beckmann ,
Ulrich Meyer
Goethe University Frankfurt am Main, Germany Peter Sanders, JohannesSingler
Karlsruhe Institute of Technology, GermanyJoule
109 recs
(deprecated)
2013, 12,092 Joules
NTOSort
82,697 records sorted / joule Lenovo X220, 2.8 Ghz Intel i5-2640M, 16GB RAM, Nsort, Windows 8, 1 OCZ 120GB mSATA Nocti SSD, 2 Samsung 840 Pro 256GB SSDsAndreas Ebert
Microsoft
2012, 21.0 KJoules
FAWNSort
47,500 records sorted / joule Intel Core i7-2700K 3.5 GHz, 8GB RAM, Nsort, 16 x 300 GB Intel 710 Series SSDs, 1 160 GB Intel 510 Series SSDPadmanabhan Pillai
, Michael
Kaminsky ,
Michael A. Kozuch
,
Intel Labs PittsburghDavid Andersen
Carnegie Mellon University2010, 27.9 KJoules
Nsort
35,800 records sorted / joule Intel Atom 330 1.6GHz, 4GB RAM, 4 x Super Talent UltraDrive GX MLC 256GBAndreas Beckmann ,
Ulrich Meyer
Goethe University Frankfurt am Main, Germany Peter Sanders, JohannesSingler
Karlsruhe Institute of Technology, Germany2007, 88 KJoules
CoolSort
11,300 records sorted / joule Mobile Core 2 Duo, 13 SATA laptop disks, 2GB RAM, Nsort Suzanne Rivoire (Stanford), MehulA. Shah (HP
Labs),
Partha Ranganathan
(HP
Labs), Christos Kozyrakis(Stanford)
2013, 12,092 Joules
NTOSort
82,697 records sorted / joule Lenovo X220, 2.8 Ghz Intel i5-2640M, 16GB RAM, Nsort, Windows 8, 1 OCZ 120GB mSATA Nocti SSD, 2 Samsung 840 Pro 256GB SSDsAndreas Ebert
Microsoft
2012, 21.0 KJoules
FAWNSort
47,500 records sorted / joule Intel Core i7-2700K 3.5 GHz, 8GB RAM, Nsort, 16 x 300 GB Intel 710 Series SSDs, 1 160 GB Intel 510 Series SSDPadmanabhan Pillai
, Michael
Kaminsky ,
Michael A. Kozuch
,
Intel Labs PittsburghDavid Andersen
Carnegie Mellon University2010, 25.1 KJoules
EcoSort
39,900 records sorted / joule Intel Atom 330 1.6GHz, 4GB RAM, 4 x Super Talent UltraDrive GX MLC 256GBAndreas Beckmann ,
Ulrich Meyer
Goethe University Frankfurt am Main, Germany Peter Sanders, JohannesSingler
Karlsruhe Institute of Technology, Germany 2010 Jan 1, 27.5 KJoulesEcoSort
36,400 records sorted / joule Intel Atom 330 1.6GHz, 4GB RAM, 4 x SuperTalent UltraDrive GX MLC 256GBAndreas Beckmann ,
Ulrich Meyer
Goethe University Frankfurt am Main, Germany Peter Sanders, JohannesSingler
Karlsruhe Institute of Technology, Germany2009, 87 KJoules
OzSort
11,600 records sorted / joule 2.6 Ghz AMD Athlon LE-1640, 4GB RAM, 7x160 GB 7200 RPM SATA, Linux Nikolas Askitis and Ranjan Sinha Univ. Melbourne, AustraliaJoule
1010 recs
2012, 229 KJoules
FAWNSort
43,700 records sorted / joule Intel Core i7-2700K 3.5 GHz, 8GB RAM, Nsort, 16 x 300 GB Intel 710 Series SSDs, 1 160 GB Intel 510 Series SSDPadmanabhan Pillai
, Michael
Kaminsky ,
Michael A. Kozuch
,
Intel Labs PittsburghDavid Andersen
Carnegie Mellon University2011, 1,900 KJoules
Nsort
5,273 records sorted / joule 2 x Intel Xeon X5550 2.67 GHz, 48 GB RAM 8 x 1TB Seagate 7200RPM SATA HDDAndreas Beckmann ,
Ulrich Meyer
Goethe University Frankfurt am Main, Germany Peter Sanders, JohannesSingler
Karlsruhe Institute of Technology, Germany2007, 2920 KJoules
CoolSort
3,425 records sorted / joule Intel Xeon 5130 2GHz, 4GB RAM, 12 x Seagate Barracuda ES 7200rpm 500GB, Nsort Suzanne Rivoire (Stanford), MehulA. Shah (HP
Labs),
Partha Ranganathan
(HP
Labs), Christos Kozyrakis(Stanford)
2013, 168 KJoules
NTOSort
59,444 records sorted / joule Intel i7-3770K, 16GB RAM, Nsort, Windows 8, 16 Samsung 840 Pro 256GB SSDs, 1 Samsung 840 Pro 128GB SSDAndreas Ebert
Microsoft
2012, 229 KJoules
FAWNSort
43,700 records sorted / joule Intel Core i7-2700K 3.5 GHz, 8GB RAM, Nsort, 16 x 300 GB Intel 710 Series SSDs, 1 160 GB Intel 510 Series SSDPadmanabhan Pillai
, Michael
Kaminsky ,
Michael A. Kozuch
,
Intel Labs PittsburghDavid Andersen
Carnegie Mellon University2010, 572 KJoules
DEMSort
17,500 records sorted / joule Intel Atom 330 1.6GHz, 4GB RAM, 4 x Super Talent UltraDrive GX MLC 256GBAndreas Beckmann ,
Ulrich Meyer
Goethe University Frankfurt am Main, Germany Peter Sanders, JohannesSingler
Karlsruhe Institute of Technology, Germany 2010 Jan 1, 724 KJoulesDEMSort
13,800 records sorted / joule Intel Atom 330 1.6GHz, 4GB RAM, 4 x SuperTalent UltraDrive GX MLC 256GBAndreas Beckmann ,
Ulrich Meyer
Goethe University Frankfurt am Main, Germany Peter Sanders, JohannesSingler
Karlsruhe Institute of Technology, GermanyJoule
1012 recs
(deprecated)
2011, 132 MJoules
TritonSort
7,595 records sorted / joule52 nodes x
(2 Quadcore processors, 24 GB memory, 16x500GB disks) Cisco Nexus 5096 switch Alex Rasmussen, Michael Conley, George Porter, Amin Vahdat, University of California, San Diego2011, 103 MJoules
TritonSort
9,700 records sorted / joule52 nodes x
(2 Quadcore processors, 24 GB memory, 16x500GB disks) Cisco Nexus 5096 switch Alex Rasmussen, Michael Conley, George Porter, Amin Vahdat, University of California, San DiegoPenny
(deprecated)
2011, 286 GB
psort
2.7 Ghz AMD Sempron, 4 GB RAM, 5x320 GB 7200 RPM Samsung SpinPoint F4 HD332GJ, Linux Paolo Bertasi, Federica Bogo, Marco Bressan and Enoch PesericoUniv. Padova, Italy
2009, 223 GB
psort
2.6 Ghz AMD Athlon LE 1640, 4 GB RAM, 5x160 GB 7200 RPM SATA, Linux Paolo Bertasi, Marco Bressan and Enoch PesericoUniv. Padova, Italy
2008, 181 GB
1,812 M records in 2,408 secondspsort
2.4 Ghz AMD Athlon 64, 2 GB RAM, 4x160GB SATA disksLinux
Paolo Bertasi, Marco Bressan and Enoch PesericoUniv. Padova, Italy
2007, 39 GB
TokuMergeSort
330$ system
2 Ghz AMD Athlon 4200+, 512 MB RAM,2x80GB SATA disks
Bradley C. Kuszmaul , MIT2006, 34 GB
Bytes-Split-Index Sort (BSIS)$760 system
1.8 GHz AMD, 1 GB RAM, 4x80GB SATA disks, WindowsXP Xing Huang and BinHeng Song School of Software, Tsinghua U., Beijing, China
Bo Huang
Math & CS, Hunan U. of Technology ,Zhuzhou, China
2005, 15 GB
PostManSort
979 sec on a $951 Wintel 2 SATARobert Ramey
2004, 10 GB
THsort
(105 million records) 1098 seconds on a $857 Linux/AMD Peng Liu, Yao Shi, Li Zhang, Kuo Zhang, Tian Wang, ZunChong Tian, Hao Wang, Xiaoge Wang Tsinghua University, Beijing, China2000, 4.5 GB
HMsort
Brad Helmkamp, Keith McCreadyStenograph LLC
1999, 2.6 GB
HMsort
Brad Helmkamp, Keith McCreadyStenograph LLC
1998, 1.3 GB
PostmanSort/NT
Robert Ramey Software2011, 334 GB
psort
2.7 Ghz AMD Sempron, 4 GB RAM, 5x320 GB 7200 RPM Samsung SpinPoint F4 HD332GJ, Linux Paolo Bertasi, Federica Bogo, Marco Bressan and Enoch PesericoUniv. Padova, Italy
2010, 252 GB
OzSort 2.0
2.8 Ghz AMD Athlon II 240, 4GB RAM, 6x160 GB 7200 RPM SATA-II, LinuxNikolas Askitis
Univ. Melbourne, Australia2009, 248 GB
psort
2.6 Ghz AMD Athlon LE 1640, 4 GB RAM, 5x160 GB 7200 RPM SATA, Linux Paolo Bertasi, Marco Bressan and Enoch PesericoUniv. Padova, Italy
2009, 246 GB
OzSort
2.7 Ghz AMD Kuma X2 7750+, 4GB RAM, 5x160 GB 7200 RPM SATA, Linux Nikolas Askitis and Ranjan Sinha Univ. Melbourne, Australia2008, 190 GB
psort
2.4 Ghz AMD Athlon 64, 2 GB RAM, 4x160GB SATA disks, Linux Paolo Bertasi, Marco Bressan and Enoch PesericoUniv. Padova, Italy
2006, 59 GB
GpuTeraSort
3 GHz Pentium IV, 2 GB RAM, 7800GT Nvidia graphics card, 9x80GB SATA disks (4 data and 5 runs) WindowsXP Naga Govindaraju, Ritesh Kumar, Dinesh Manocha, Jim Gray U. North Carolina at Chapel Hill, USA2003, 43 GB
SheenkSort
Linux/AMD system
Lei Yang, Hui Huang,Zheng Wan, Tao Song
Tsinghua University, Beijing, China2001, 12 GB
DMsort
Araron Darling, Alex Mohr, U. Wisconsin, Madison2000, 4.5 GB
HMsort
Brad Helmkamp, Keith McCreadyStenograph LLC
1999, 2.6 GB
HMsort
Brad Helmkamp, Keith McCreadyStenograph LLC
1998, 1.5 GB
NT Sort
Microsoft
TeraByte
(deprecated)
2008, 3.48 minutes
Hadoop
910 nodes x (4 dual-core processors, 4 disks, 8 GB memory)Owen OMalley, Yahoo
2007, 4.95 min
TokuSampleSort
tx2500 disk cluster
400 nodes x (2 processors, 6-disk RAID, 8 GB memory) Bradley C. Kuszmaul , MIT2004, 33 min
Nsort
Windows, 32 Itanium2, 2,350 SAN disks Chris Nyberg, Charles KoesterOrdinal Technology
2000, 49 min
Tandem FastSort
68x2 Compaq Tandem Sandia Daivd Cossock , Sam Fineberg, Pankaj Mehra , John PeckTandem
1998, 151 min
Nsort
SGI 32x Origin 2000
Chris Nyberg, Charles KoesterOrdinal Technology
2007, 3.28 minutes
TokuSampleSort
tx2500 disk cluster
400 nodes x (2 processors, 6-disk RAID, 8 GB memory) Bradley C. Kuszmaul , MIT2005, 7.25 min
SCS
Linux, 80 Itanium2, 2,520 SAN disks Jim Wyllie , IBM Almaden Research2000, 18 min
SPsort
1952 SP cluster 2168 disks Jim Wyllie , IBM Almaden Research1998, 151 min
Nsort
SGI 32x Origin 2000
Chris Nyberg, Charles KoesterOrdinal Technology
Datamation
(deprecated)
2001, .44 sec
Datamation 2001: A Sorting Odyssey NOW-sort on 32 Linux PCs (2xP3(550 MHz), 1 GB, 5x9GB disks). Florentina Popovici, John Bent, Brian Forney, Andrea Arpaci Dusseau, Remzi Arpaci Dusseau2000, .998 sec
Mitsubishi DIAPRISM Hardware Sorter HP 4 x 550MHz Xeon PC server + 32 SCSI disks, Windows NT4 Shinsuke Azuma, Takao Sakuma, Tetsuya Takeo, Takaaki Ando, Kenji Shirai Mitsubishi Electric Corp.1999, 1.18 sec
Millennium Sort
16x2 Dell NT Myrinet Phillip Buonadonna, Spencer Low, Josh CoatesUC Berkeley
1997, 2.4 sec
NowSort
Arpaci-Dusseau
UC Berkeley
1996, 4.2 sec
Nsort
SGI Challenge
Chris Nyberg, Charles KoesterOrdinal Technology
1994, 7 sec
AlphaSort
Nyberg, DEC
1993, 9 sec
AlphaSort
Nyberg, DEC
1988, 28 sec
Cray1
Weinberger
1987, 980 sec
Tandem
Tsukerman
This page is maintained by Chris Nyberg (chris dot nyberg at ordinal dot com) and Mehul Shah (mashah at gmail dot com).Details
Copyright © 2024 ArchiveBay.com. All rights reserved. Terms of Use | Privacy Policy | DMCA | 2021 | Feedback | Advertising | RSS 2.0