{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:34Z","timestamp":1763468074101,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,20]],"date-time":"2012-05-20T00:00:00Z","timestamp":1337472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,20]]},"DOI":"10.1145\/2213836.2213965","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"841-850","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["CloudRAMSort"],"prefix":"10.1145","author":[{"given":"Changkyu","family":"Kim","sequence":"first","affiliation":[{"name":"Intel Labs, Santa Clara, CA., USA"}]},{"given":"Jongsoo","family":"Park","sequence":"additional","affiliation":[{"name":"Intel Labs, Santa Clara, CA., USA"}]},{"given":"Nadathur","family":"Satish","sequence":"additional","affiliation":[{"name":"Intel Labs, Santa Clara, CA., USA"}]},{"given":"Hongrae","family":"Lee","sequence":"additional","affiliation":[{"name":"Google Research, Mountain View, USA"}]},{"given":"Pradeep","family":"Dubey","sequence":"additional","affiliation":[{"name":"Intel Labs, Santa Clara, CA., USA"}]},{"given":"Jatin","family":"Chhugani","sequence":"additional","affiliation":[{"name":"Intel Labs, Santa Clara, CA., USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Apache Hadoop. http:\/\/hadoop.apache.org.  Apache Hadoop. http:\/\/hadoop.apache.org."},{"key":"e_1_3_2_1_2_1","unstructured":"bonnie++: a program to test hard drive performance. http:\/\/www.coker.com.au\/bonnie++  bonnie++: a program to test hard drive performance. http:\/\/www.coker.com.au\/bonnie++"},{"key":"e_1_3_2_1_3_1","unstructured":"Data Generator For Sorting Benchmarks. www.ordinal.com\/gensort.html.  Data Generator For Sorting Benchmarks. www.ordinal.com\/gensort.html."},{"key":"e_1_3_2_1_4_1","unstructured":"Hadoop Cluster Setup. http:\/\/hadoop.apache.org\/common\/docs\/current\/cluster_setup.html.  Hadoop Cluster Setup. http:\/\/hadoop.apache.org\/common\/docs\/current\/cluster_setup.html."},{"key":"e_1_3_2_1_5_1","unstructured":"OpenFabrics Alliance. https:\/\/www.openfabrics.org\/index.php.  OpenFabrics Alliance. https:\/\/www.openfabrics.org\/index.php."},{"key":"e_1_3_2_1_6_1","unstructured":"SAS In-Memory Analytics. http:\/\/www.sas.com\/software\/high-performance-computing\/in-memory-analytics\/.  SAS In-Memory Analytics. http:\/\/www.sas.com\/software\/high-performance-computing\/in-memory-analytics\/."},{"key":"e_1_3_2_1_7_1","unstructured":"Sort Benchmark Home Page. http:\/\/sortbenchmark.org.  Sort Benchmark Home Page. http:\/\/sortbenchmark.org."},{"key":"e_1_3_2_1_8_1","unstructured":"The Message Passing Interface (MPI) standard. http:\/\/www.mcs.anl.gov\/research\/projects\/mpi\/.  The Message Passing Interface (MPI) standard. http:\/\/www.mcs.anl.gov\/research\/projects\/mpi\/."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.224220"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1815961.1816004"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1740390.1740400"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253322"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/113379.113380"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2010.33"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454171"},{"issue":"9","key":"e_1_3_2_1_18_1","volume":"22","author":"Cho H.","year":"2004","unstructured":"H. Cho , P. Kapur , and K. C. Saraswat . Power Comparison Between High-Speed Electrical and Optical Interconnects for Interchip Communication. Journal of Lightwave Technology , 22 ( 9 ), 2004 . H. Cho, P. Kapur, and K. C. Saraswat. Power Comparison Between High-Speed Electrical and Optical Interconnects for Interchip Communication. Journal of Lightwave Technology, 22(9), 2004.","journal-title":"Journal of Lightwave Technology"},{"key":"e_1_3_2_1_19_1","first-page":"339","volume-title":"VLDB","author":"Cieslewicz J.","year":"2007","unstructured":"J. Cieslewicz and K. A. Ross . Adaptive aggregation on chip multiprocessors . In VLDB , pages 339 -- 350 , 2007 . J. Cieslewicz and K. A. Ross. Adaptive aggregation on chip multiprocessors. In VLDB, pages 339--350, 2007."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1950365.1950380"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629589"},{"key":"e_1_3_2_1_22_1","first-page":"137","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . Mapreduce: Simplified data processing on large clusters . In OSDI , pages 137 -- 150 , 2004 . J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137--150, 2004."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.50905"},{"key":"e_1_3_2_1_24_1","first-page":"280","volume-title":"International Conference on Parallel and Distributed Information Systems","author":"DeWitt D. J.","unstructured":"D. J. DeWitt , J. F. Naughton , and D. A. Schneider . Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting . In International Conference on Parallel and Distributed Information Systems , pages 280 -- 291 . D. J. DeWitt, J. F. Naughton, and D. A. Schneider. Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting. In International Conference on Parallel and Distributed Information Systems, pages 280--291."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2008.30"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807286"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38755"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191886"},{"key":"e_1_3_2_1_29_1","volume-title":"International Computer Software and Applications Conference","author":"Huang J. S.","year":"1983","unstructured":"J. S. Huang and Y. C. Chow . Parallel sorting and data partitioning by sampling . In International Computer Software and Applications Conference , 1983 . J. S. Huang and Y. C. Chow. Parallel sorting and data partitioning by sampling. In International Computer Software and Applications Conference, 1983."},{"key":"e_1_3_2_1_30_1","volume-title":"Intel White Paper","author":"Research Intel","year":"2010","unstructured":"Intel Research . Light Peak : Overview . Intel White Paper , 2010 . Intel Research. Light Peak: Overview. Intel White Paper, 2010."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_3_2_1_32_1","first-page":"135","volume-title":"VLDB","author":"Iyer B. R.","year":"1989","unstructured":"B. R. Iyer , G. R. Ricard , and P. J. Varman . Percentile Finding Algorithm for Multiple Sorted Runs . In VLDB , pages 135 -- 144 , 1989 . B. R. Iyer, G. R. Ricard, and P. J. Varman. Percentile Finding Algorithm for Multiple Sorted Runs. In VLDB, pages 135--144, 1989."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1993.17"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807206"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687564"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250662.1250679"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.35"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2009.2024163"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1785414.1785441"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/4492.4495"},{"key":"e_1_3_2_1_41_1","first-page":"1","volume-title":"Architectural evaluation of 3d stacked rram caches. In 3DIC","author":"Lewis D. L.","year":"2009","unstructured":"D. L. Lewis and H.-H. S. Lee . Architectural evaluation of 3d stacked rram caches. In 3DIC , pages 1 -- 4 , 2009 . D. L. Lewis and H.-H. S. Lee. Architectural evaluation of 3d stacked rram caches. In 3DIC, pages 1--4, 2009."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.37"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2010.15"},{"key":"e_1_3_2_1_44_1","volume-title":"In-Memory Database Systems: Myths and Facts","author":"M.","year":"2010","unstructured":"M. LLC. In-Memory Database Systems: Myths and Facts . 2010 . M. LLC. In-Memory Database Systems: Myths and Facts. 2010."},{"key":"e_1_3_2_1_45_1","unstructured":"O. O'Malley and A. C. Murthy. Winning a 60 Second Dash with a Yellow Elephant. http:\/\/sortbenchmark.org\/Yahoo2009.pdf 2009.  O. O'Malley and A. C. Murthy. Winning a 60 Second Dash with a Yellow Elephant. http:\/\/sortbenchmark.org\/Yahoo2009.pdf 2009."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1713254.1713276"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1022594.1022596"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559865"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2011.18"},{"key":"e_1_3_2_1_50_1","volume-title":"TritonSort: A Balanced Large-Scale Sorting System. In USENIX conference on Networked System Design and Implementation","author":"Rasmussen A.","year":"2011","unstructured":"A. Rasmussen , G. Porter , M. Conley , H. V. Madhyastha , R. N. Mysore , A. Pucher , and A. Vahdat . TritonSort: A Balanced Large-Scale Sorting System. In USENIX conference on Networked System Design and Implementation , 2011 . A. Rasmussen, G. Porter, M. Conley, H. V. Madhyastha, R. N. Mysore, A. Pucher, and A. Vahdat. TritonSort: A Balanced Large-Scale Sorting System. In USENIX conference on Networked System Design and Implementation, 2011."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807207"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1399504.1360617"},{"key":"e_1_3_2_1_53_1","unstructured":"S. Seshadri and J. F. Naughton. Sampling Issues in Parallel Database Systems. In Advanced in Database Technology - EDBT.   S. Seshadri and J. F. Naughton. Sampling Issues in Parallel Database Systems. In Advanced in Database Technology - EDBT."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90075-X"},{"key":"e_1_3_2_1_55_1","first-page":"1","volume-title":"International Symposium on Parallel and Distributed Processing (IPDPS)","author":"Solomonik E.","unstructured":"E. Solomonik and L. V. Kal\u00e9 . Highly scalable parallel sorting . In International Symposium on Parallel and Distributed Processing (IPDPS) , pages 1 -- 12 . E. Solomonik and L. V. Kal\u00e9. Highly scalable parallel sorting. In International Symposium on Parallel and Distributed Processing (IPDPS), pages 1--12."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629175.1629197"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687671"}],"event":{"name":"SIGMOD\/PODS '12: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Scottsdale Arizona USA","acronym":"SIGMOD\/PODS '12"},"container-title":["Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213836.2213965","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213836.2213965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:53Z","timestamp":1750238453000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213836.2213965"}},"subtitle":["fast and efficient large-scale distributed RAM sort on shared-nothing cluster"],"short-title":[],"issued":{"date-parts":[[2012,5,20]]},"references-count":56,"alternative-id":["10.1145\/2213836.2213965","10.1145\/2213836"],"URL":"https:\/\/doi.org\/10.1145\/2213836.2213965","relation":{},"subject":[],"published":{"date-parts":[[2012,5,20]]},"assertion":[{"value":"2012-05-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}