{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:22Z","timestamp":1750308802365,"version":"3.41.0"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2011,5]]},"abstract":"<jats:p>\n            <jats:italic>psort<\/jats:italic>\n            is the fastest sorting software according to the PennySort benchmark, sorting 181GB of data in 2008 and 224GB in 2009 for $0.01 of computer time. This article details its internals, and the careful fitting of its architecture to the structure of modern PC-class platforms, allowing it to outperform state-of-the-art sorting software such as\n            <jats:italic>STXXL sort<\/jats:italic>\n            .\n          <\/jats:p>","DOI":"10.1145\/1963190.1970377","type":"journal-article","created":{"date-parts":[[2012,10,15]],"date-time":"2012-10-15T19:22:23Z","timestamp":1350328943000},"source":"Crossref","is-referenced-by-count":2,"title":["<i>psort<\/i>\n            , yet another fast stable sorting software"],"prefix":"10.1145","volume":"16","author":[{"given":"Paolo","family":"Bertasi","sequence":"first","affiliation":[{"name":"Universit\u00e0 degli Studi di Padova, Italy"}]},{"given":"Marco","family":"Bressan","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Padova, Italy"}]},{"given":"Enoch","family":"Peserico","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Padova, Italy"}]}],"member":"320","published-online":{"date-parts":[[2011,7,27]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28428"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.31"},{"key":"e_1_2_1_3_1","unstructured":"Ailamaki A. DeWitt D. J. Hill M. D. and Wood D. A. 1999. DBMSs on a modern processor: where does time go&quest; In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB'99). Springer Berlin 266--277.   Ailamaki A. DeWitt D. J. Hill M. D. and Wood D. A. 1999. DBMSs on a modern processor: where does time go&quest; In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB'99). Springer Berlin 266--277."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Alpern B. Carter L. Feig E. and Selker T. 1994. The uniform memory hierarchy model of computation. Algorithmica 12 2\/3 72--109.  Alpern B. Carter L. Feig E. and Selker T. 1994. The uniform memory hierarchy model of computation. Algorithmica 12 2\/3 72--109.","DOI":"10.1007\/BF01185206"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253322"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02011-7_9"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564886"},{"key":"e_1_2_1_8_1","first-page":"112","article-title":"A measure of transaction processing power","volume":"31","author":"Bitton D.","year":"1985","unstructured":"Bitton , D. , Brown , M. , Catell , R. , Ceri , S. , Chou , T. , DeWitt , D. , Gawlick , D. , Garcia-Molina , H. , Good , B. , 1985 . A measure of transaction processing power . Datamation 31 , 7, 112 -- 118 . Bitton, D., Brown, M., Catell, R., Ceri, S., Chou, T., DeWitt, D., Gawlick, D., Garcia-Molina, H., Good, B., et al. 1985. A measure of transaction processing power. Datamation 31, 7, 112--118.","journal-title":"Datamation"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777435"},{"volume-title":"Proceedings of the 1st International Conference on Parallel and Distributed Information Systems (PDIS'91)","author":"DeWitt D. J.","key":"e_1_2_1_10_1","unstructured":"DeWitt , D. J. , Naughton , J. F. , and Schneider , D. A . 1991. Parallel sorting on a shared-nothing architecture using probabilistic splitting . In Proceedings of the 1st International Conference on Parallel and Distributed Information Systems (PDIS'91) . IEEE, Los Alamitos, CA, 280--291. DeWitt, D. J., Naughton, J. F., and Schneider, D. A. 1991. Parallel sorting on a shared-nothing architecture using probabilistic splitting. In Proceedings of the 1st International Conference on Parallel and Distributed Information Systems (PDIS'91). IEEE, Los Alamitos, CA, 280--291."},{"key":"e_1_2_1_11_1","unstructured":"GNUSort. GNU Coreutils sort. http:\/\/www.gnu.org\/software\/coreutils\/.  GNUSort. GNU Coreutils sort. http:\/\/www.gnu.org\/software\/coreutils\/."},{"key":"e_1_2_1_12_1","unstructured":"Gray J. 2007. A measure of transaction processing 20 years later. CoRR abs\/cs\/0701162.  Gray J. 2007. A measure of transaction processing 20 years later. CoRR abs\/cs\/0701162."},{"key":"e_1_2_1_13_1","unstructured":"Gray J. Coates J. and Nyberg C. 1998. Performance\/price sort. CoRR cs.DB\/9809004.  Gray J. Coates J. and Nyberg C. 1998. Performance\/price sort. CoRR cs.DB\/9809004."},{"key":"e_1_2_1_14_1","volume-title":"Computer Architecture: A Quantitative Approach","author":"Hennessy J. L.","year":"1996","unstructured":"Hennessy , J. L. and Patterson , D. A . 1996 . Computer Architecture: A Quantitative Approach , 2 nd Ed. Kaufmann , San Francisco . Hennessy, J. L. and Patterson, D. A. 1996. Computer Architecture: A Quantitative Approach, 2nd Ed. Kaufmann, San Francisco.","edition":"2"},{"key":"e_1_2_1_15_1","volume-title":"The Art of Computer Programming, Volume 3: Sorting and Searching","author":"Knuth D. E.","unstructured":"Knuth , D. E. 1998. The Art of Computer Programming, Volume 3: Sorting and Searching , 2 nd Ed. Addison-Wesley . Knuth, D. E. 1998. The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd Ed. Addison-Wesley.","edition":"2"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584026"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0993-2"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210343"},{"key":"e_1_2_1_19_1","unstructured":"Nsort. Ordinal Technology. Nsort User Guide. http:\/\/www.ordinal.com\/NsortUserGuide.pdf.  Nsort. Ordinal Technology. Nsort User Guide. http:\/\/www.ordinal.com\/NsortUserGuide.pdf."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/615232.615237"},{"key":"e_1_2_1_21_1","unstructured":"Nyberg C. Koester C. and Gray J. 1997. Nsort: a parallel sorting program for NUMA and SMP machines. Ordinal Technologies white paper 1997. http:\/\/www.ordinal.com\/white\/whitepaper.htm.  Nyberg C. Koester C. and Gray J. 1997. Nsort: a parallel sorting program for NUMA and SMP machines. Ordinal Technologies white paper 1997. http:\/\/www.ordinal.com\/white\/whitepaper.htm."},{"key":"e_1_2_1_22_1","unstructured":"OzSort. http:\/\/www.ozsort.com\/.  OzSort. http:\/\/www.ozsort.com\/."},{"key":"e_1_2_1_23_1","unstructured":"QSort. GNU C library Array Sort Function. http:\/\/www.gnu.org\/s\/libc\/manual\/html_node\/Array-Sort-Function.html.  QSort. GNU C library Array Sort Function. http:\/\/www.gnu.org\/s\/libc\/manual\/html_node\/Array-Sort-Function.html."},{"volume-title":"Proceedings of the 5th International Workshop on Algorithm Engineering (WAE'01)","author":"Rahman N.","key":"e_1_2_1_24_1","unstructured":"Rahman , N. , Cole , R. , and Raman , R . 2001. Optimised predecessor data structures for internal memory . In Proceedings of the 5th International Workshop on Algorithm Engineering (WAE'01) . Springer, Berlin, 67--78. Rahman, N., Cole, R., and Raman, R. 2001. Optimised predecessor data structures for internal memory. In Proceedings of the 5th International Workshop on Algorithm Engineering (WAE'01). Springer, Berlin, 67--78."},{"key":"e_1_2_1_25_1","unstructured":"Postman's Sort. http:\/\/www.rrsd.com\/software_development\/postmans_sort\/.  Postman's Sort. http:\/\/www.rrsd.com\/software_development\/postmans_sort\/."},{"key":"e_1_2_1_26_1","unstructured":"Sort Benchmark. Home page. http:\/\/sortbenchmark.org\/.  Sort Benchmark. Home page. http:\/\/sortbenchmark.org\/."},{"key":"e_1_2_1_27_1","unstructured":"STLSort. GNU C++ library \u011brb+std+ namespace. http:\/\/gcc.gnu.org\/onlinedocs\/libstdc++\/libstdc++-html-USERS-4.1\/namespacestd.html.  STLSort. GNU C++ library \u011brb+std+ namespace. http:\/\/gcc.gnu.org\/onlinedocs\/libstdc++\/libstdc++-html-USERS-4.1\/namespacestd.html."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_1_29_1","unstructured":"Yang L. Huang H. Wan Z. and Song T. 2003. SheenkSort: 2003 Performance\/Price Sort and PennySort. http:\/\/sortbenchmark.org\/SheenkSort.pdf.  Yang L. Huang H. Wan Z. and Song T. 2003. SheenkSort: 2003 Performance\/Price Sort and PennySort. http:\/\/sortbenchmark.org\/SheenkSort.pdf."}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1963190.1970377","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1963190.1970377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:02Z","timestamp":1750278362000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1963190.1970377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":29,"alternative-id":["10.1145\/1963190.1970377"],"URL":"https:\/\/doi.org\/10.1145\/1963190.1970377","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"type":"print","value":"1084-6654"},{"type":"electronic","value":"1084-6654"}],"subject":[],"published":{"date-parts":[[2011,5]]}}}