{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:40:40Z","timestamp":1725532840130},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020100"},{"type":"electronic","value":"9783642020117"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02011-7_9","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T09:12:20Z","timestamp":1243933940000},"page":"76-88","source":"Crossref","is-referenced-by-count":4,"title":["psort, Yet Another Fast Stable Sorting Software"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Bertasi","sequence":"first","affiliation":[]},{"given":"Marco","family":"Bressan","sequence":"additional","affiliation":[]},{"given":"Enoch","family":"Peserico","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"The GNU C library - Array Sort Function, http:\/\/www.gnu.org\/"},{"key":"9_CR2","unstructured":"GNU Coreutils - sort, http:\/\/www.gnu.org\/"},{"key":"9_CR3","unstructured":"Sort Benchmark Home Page, http:\/\/www.hpl.hp.com\/hosted\/sortbenchmark\/"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"A measure of transaction processing power. Datamation\u00a031(7), 112\u2013118 (1985)","DOI":"10.1049\/ep.1985.0091"},{"key":"9_CR5","unstructured":"Aaron Darling, A.M.: DMSort: A PennySort and Performance\/Price Sort, http:\/\/www.hpl.hp.com\/hosted\/sortbenchmark\/DMsort.pdf"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Alpern, B., Chandra, A., Snir, M.: A model for hierarchical memory. In: Proc. of ACM STOC 1987, pp. 305\u2013314 (1987)","DOI":"10.1145\/28395.28428"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Chandra, A.K., Snir, M.: Hierarchical memory with block transfer. In: Proc. of IEEE FOCS 1987, pp. 204\u2013216 (1987)","DOI":"10.1109\/SFCS.1987.31"},{"key":"9_CR8","unstructured":"Ailamaki, A., Dewitt, D.J., Hill, M.D., Wood, D.A.: Dbmss on a modern processor: Where does time go. In: Proc. of VLBD (1999)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Alpern, B., Carter, L., Feig, E., Selker, T.: The uniform memory hierarchy model of computation. Algorithmica\u00a012, 72\u2013109 (1994)","DOI":"10.1007\/BF01185206"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Arpaci-Dusseau, A.C., Arpaci-Dusseau, R.H., Culler, D.E., Hellerstein, J.M., Patterson, D.A.: High-performance sorting on networks of workstations. In: Proc. of ACM SIGMOD 1997, vol.\u00a026(2), pp. 243\u2013254 (1997)","DOI":"10.1145\/253260.253322"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Bilardi, G., Ekanadham, K., Pattnaik, P.: Optimal organizations for pipelined hierarchical memories. In: Proc. of ACM SPAA 2002, pp. 109\u2013116 (2002)","DOI":"10.1145\/564870.564886"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Dementiev, R., Sanders, P.: Asynchronous parallel disk sorting. In: Proc. of ACM SPAA 2003, pp. 138\u2013148 (2003)","DOI":"10.1145\/777412.777435"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Dewitt, D.J., Naughton, J.F., Schneider, D.A.: Parallel sorting on a shared-nothing architecture using probabilistic splitting. In: Proc. of PDIS 1991 (1991)","DOI":"10.1109\/PDIS.1991.183115"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Govindaraju, N.K., Gray, J., Kumar, R., Manocha, D.: Gputerasort: High performance graphics coprocessor sorting for large database management. In: Proc. of ACM SIGMOD ICMD 2006 (2006)","DOI":"10.1145\/1142473.1142511"},{"key":"9_CR15","unstructured":"Gray, J.: A measure of transaction processing 20 years later. CoRR, abs\/cs\/0701162 (2007)"},{"key":"9_CR16","unstructured":"Gray, J., Coates, J., Nyberg, C.: Price\/performance sort and 1998 pennysort performance\/price sort and pennysort (1998)"},{"key":"9_CR17","unstructured":"Hennessy, J., Hennessy, J.L., Goldberg, D., Patterson, D.A.: Computer Architecture: A Quantitative Approach, 1st edn. Morgan Kaufmann Publishers, San Francisco"},{"key":"9_CR18","series-title":"Sorting and Searching","volume-title":"Art of Computer Programming","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: Art of Computer Programming, 2nd edn. Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1998)","edition":"2"},{"key":"9_CR19","unstructured":"Lei Yang, Z.W., Huang, H., Song, T.: SheenkSort, Performance\/Price Sort and PennySort (2003), http:\/\/www.hpl.hp.com\/hosted\/sortbenchmark\/SheenkSort.pdf"},{"issue":"35","key":"9_CR20","first-page":"75","volume":"1","author":"K. Mehlhorn","year":"2003","unstructured":"Mehlhorn, K., Sanders, P.: Scanning multiple sequences via cache memory. Algorithmica\u00a01(35), 75\u201393 (2003)","journal-title":"Algorithmica"},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1145\/210332.210343","volume":"42","author":"M.H. Nodine","year":"1995","unstructured":"Nodine, M.H., Vitter, J.S.: Greed sort: optimal deterministic sorting on parallel disks. J. ACM\u00a042(4), 919\u2013933 (1995)","journal-title":"J. ACM"},{"issue":"4","key":"9_CR22","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/BF01354877","volume":"4","author":"C. Nyberg","year":"1995","unstructured":"Nyberg, C., Barclay, T., Cvetanovic, Z., Gray, J., Lomet, D.B.: Alphasort: A cache-sensitive parallel external sort. VLDB J.\u00a04(4), 603\u2013627 (1995)","journal-title":"VLDB J."},{"key":"9_CR23","unstructured":"Liu, P., Shi, Y., Zhang, L.: 2002 Performance \/ Price Sort and PennySort (2002), http:\/\/www.hpl.hp.com\/hosted\/sortbenchmark\/THsort.pdf"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-44688-5_6","volume-title":"Algorithm Engineering","author":"N. Rahman","year":"2001","unstructured":"Rahman, N., Cole, R., Raman, R.: Optimised predecessor data structures for internal memory. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol.\u00a02141, pp. 67\u201378. Springer, Heidelberg (2001)"},{"key":"9_CR25","unstructured":"Ramey, R.: Postman\u2019s Sort, http:\/\/www.rrsd.com\/"},{"issue":"8","key":"9_CR26","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. Valiant","year":"1990","unstructured":"Valiant, L.: A bridging model for parallel computation. Comm. ACM\u00a033(8), 103\u2013111 (1990)","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02011-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T14:55:28Z","timestamp":1558364128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02011-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020100","9783642020117"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02011-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}