TritonSort: A balanced large-scale sorting system

Proceedings of NSDI 2011: 8th USENIX Symposium on Networked Systems Design and Implementation

Volumn , Issue , 2011, Pages 29-42

  Rasmussen, Alexander ^c   Porter, George ^c   Conley, Michael ^c   Madhyastha, Harsha V ^a   Mysore, Radhika Niranjan ^c   Pucher, Alexander ^b   Vahdat, Amin ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; EFFICIENCY; LARGE DATASET; SORTING; SYSTEMS ANALYSIS;

ABSOLUTE PERFORMANCE; BALANCED SYSTEM DESIGNS; CAREFUL MANAGEMENT; HARDWARE AND SOFTWARE ARCHITECTURES; HIGH SCALABILITIES; SCALE-OUT ARCHITECTURES; SERVER PERFORMANCE; SYSTEM RESOURCES;

INFORMATION MANAGEMENT;

EID: 84894556279     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. CACM, 1988.
2. M. Alizadeh, A. Greenberg, D. A. Maltz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan. Data Center TCP (DCTCP). In SIGCOMM, 2010.
3. G. Amdahl. Storage and I/O Parameters and System Potential. In IEEE Computer Group Conference, 1970.
4. E. Anderson and J. Tucek. Efficiency matters! In HotStorage, 2009.
5. Anon et al. A Measure of Transaction Processing Power. Datamation, 1985.
6. A. C. Arpaci-Dusseau, R. H. Arpaci-Dusseau, D. E. Culler, J. M. Hellerstein, and D. A. Patterson. Highperformance sorting on networks of workstations. In SIGMOD, 1997.
7. R. Arpaci-Dusseau, A. Arpaci-Dusseau, D. Culler, J. Hellerstein, and D. Patterson. The architectural costs of streaming I/O: A comparison of workstations, clusters, and SMPs. In HPCA, pages 90-101, 1998.
8. R. E. Bryant. Data-Intensive Supercomputing: The Case for DISC. Technical Report CMU-CS-07-128, CMU, 2007.
9. J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI, 2004.
10. D. DeWitt, S. Ghandeharizadeh, D. Schneider, A. Bricker, H.-I. Hsiao, and R. Rasmussen. The Gamma Database Machine Project. TKDE, 1990.
11. S. Ghemawat, H. Gobioff, and S.-T. Leung. The Google file system. In SOSP, 2003.
12. G. Graefe. Volcano-an extensible and parallel query evaluation system. TKDE, 1994.
13. J. Gray and G. R. Putzolu. The 5 Minute Rule for Trading Memory for Disk Accesses and The 10 Byte Rule for Trading Memory for CPU Time. In SIGMOD, 1987.
14. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: distributed data-parallel programs from sequential building blocks. In EuroSys, 2007.
15. B. C. Kuszmaul. TeraByte TokuSampleSort, 2007. http://sortbenchmark.org/tokutera.pdf.
16. C. Nyberg, T. Barclay, Z. Cvetanovic, J. Gray, and D. Lomet. Alphasort: A cache-sensitive parallel external sort. In VLDB, 1995.
17. C. Nyberg, C. Koester, and J. Gray. NSort: a Parallel Sorting Program for NUMA and SMP Machines, 1997.
18. M. Rahn, P. Sanders, J. Singler, and T. Kieritz. DEMSort -Distributed External Memory Sort, 2009. http://sortbenchmark.org/demsort.pdf.
19. Sort Benchmark Home Page. http://sortbenchmark.org/.
20. M. Welsh, D. Culler, and E. Brewer. SEDA: an architecture for well-conditioned, scalable internet services. In SOSP, 2001.
21. J. Wyllie. Sorting on a Cluster Attached to a Storage-Area Network, 2005. http://sortbenchmark.org/2005SCSWyllie.pdf.
22. Apache hadoop. http://hadoop.apache.org/.
23. Scaling Hadoop to 4000 nodes at Yahoo! http://developer.yahoo.net/blogs/hadoop/2008/09/scalinghadoopto4000nodesa.html.