{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:58:57Z","timestamp":1775145537374,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540230250","type":"print"},{"value":"9783540301400","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_69","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"784-796","source":"Crossref","is-referenced-by-count":37,"title":["Super Scalar Sample Sort"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Winkel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"69_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, R.: A super scalar sort algorithm for RISC processors. In: ACM SIGMOD Int. Conf. on Management of Data, pp. 240\u2013246 (1996)","DOI":"10.1145\/233269.233336"},{"issue":"9","key":"69_CR2","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Communications of the ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Communications of the ACM"},{"issue":"3","key":"69_CR3","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1145\/212094.212131","volume":"27","author":"V.H. Allan","year":"1995","unstructured":"Allan, V.H., Jones, R.B., Lee, R.M., Allan, S.J.: Software Pipelining. Computing Surveys\u00a027(3), 367\u2013432 (1995)","journal-title":"Computing Surveys"},{"key":"69_CR4","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Leiserson, C.E., Maggs, B.M., Plaxton, C.G., Smith, S.J., Zagha, M.: A comparison of sorting algorithms for the connection machine CM-2. In: ACM Symposium on Parallel Architectures and Algorithms, pp. 3\u201316 (1991)","DOI":"10.1145\/113379.113380"},{"key":"69_CR5","unstructured":"Brodal, G.S., Fagerberg, R., Vinther, K.: Engineering a cache-oblivious sorting algorithm. In: 6th Workshop on Algorithm Engineering and Experiments (2004)"},{"key":"69_CR6","unstructured":"Dulong, C., Krishnaiyer, R., Kulkarni, D., Lavery, D., Li, W., Ng, J., Sehr, D.: An Overview of the Intel\u00ae IA-64 Compiler. Intel Technology Journal (Q4) (1999)"},{"key":"69_CR7","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: 40th Symposium on Foundations of Computer Science, pp. 285\u2013298 (1999)","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"69_CR8","volume-title":"Computer Architecture a Quantitative Approach","author":"J.L. Hennessy","year":"2002","unstructured":"Hennessy, J.L., Patterson, D.A.: Computer Architecture a Quantitative Approach, 3rd edn. Morgan Kaufmann, San Francisco (2002)","edition":"3"},{"issue":"7","key":"69_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C.A.R. Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Quicksort. Communication of the ACM\u00a04(7), 321 (1961)","journal-title":"Communication of the ACM"},{"key":"69_CR10","unstructured":"Intel. Intel\u00ae Itanium\u00ae 2 Processor Reference Manual for Software Development and Optimization (April 2003)"},{"key":"69_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-36574-5_8","volume-title":"Algorithms for Memory Hierarchies","author":"D. Jiminez-Gonzalez","year":"2003","unstructured":"Jiminez-Gonzalez, D., Larriba-Pey, J.-L., Navarro, J.J.: Algorithms for Memory Hierarchies. In: Meyer, U., Sanders, P., Sibeyn, J.F. (eds.) Algorithms for Memory Hierarchies. LNCS, vol.\u00a02625, pp. 171\u2013192. Springer, Heidelberg (2003)"},{"key":"69_CR12","volume-title":"The Art of Computer Programming\u2014 Sortingand Searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming\u2014 Sortingand Searching, 2nd edn., vol.\u00a03. Addison-Wesley, Reading (1998)","edition":"2"},{"key":"69_CR13","unstructured":"LaMarca, A., Ladner, R.E.: The influence of caches on the performance of sorting. In: 8th Symposium on Discrete Algorithm, pp. 370\u2013379 (1997)"},{"issue":"3","key":"69_CR14","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1137\/S0097539700382108","volume":"31","author":"C. Mart\u00ednez","year":"2002","unstructured":"Mart\u00ednez, C., Roura, S.: Optimal sampling strategies in Quicksort and Quickselect. SIAM Journal on Computing\u00a031(3), 683\u2013705 (2002)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"69_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00453-002-0993-2","volume":"35","author":"K. Mehlhorn","year":"2003","unstructured":"Mehlhorn, K., Sanders, P.: Scanning multiple sequences via cache memory. Algorithmica\u00a035(1), 75\u201393 (2003)","journal-title":"Algorithmica"},{"key":"69_CR16","volume-title":"Advanced Compiler Design and Implementation","author":"S.S. Muchnick","year":"1997","unstructured":"Muchnick, S.S.: Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers, San Francisco (1997)"},{"issue":"8","key":"69_CR17","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1002\/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-#","volume":"27","author":"D.R. Musser","year":"1997","unstructured":"Musser, D.R.: Introspective sorting and selection algorithms. Softw. Pract. Exper.\u00a027(8), 983\u2013993 (1997)","journal-title":"Softw. Pract. Exper."},{"key":"69_CR18","doi-asserted-by":"crossref","unstructured":"Nyberg, C., Barclay, T., Cvetanovic, Z., Gray, J., Lomet, D.: AlphaSort: A RISC machine sort. In: SIGMOD, pp. 233\u2013242 (1994)","DOI":"10.1145\/191839.191884"},{"key":"69_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-36574-5_8","volume-title":"Algorithms for Memory Hierarchies","author":"N. Rahman","year":"2003","unstructured":"Rahman, N.: Algorithms for Memory Hierarchies. In: Meyer, U., Sanders, P., Sibeyn, J.F. (eds.) Algorithms for Memory Hierarchies. LNCS, vol.\u00a02625, pp. 171\u2013192. Springer, Heidelberg (2003)"},{"key":"69_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-44467-X_9","volume-title":"High Performance Computing - HiPC 2000","author":"A. Ranade","year":"2000","unstructured":"Ranade, A., Kothari, S.C., Udupa, U.R.U.: Register efficient mergesorting. In: Prasanna, V.K., Vajapeyam, S., Valero, M. (eds.) HiPC 2000. LNCS, vol.\u00a01970, pp. 96\u2013103. Springer, Heidelberg (2000)"},{"key":"69_CR21","doi-asserted-by":"crossref","unstructured":"Riedlinger, R., Grutkowski, T.: The High Bandwidth, 256KB 2nd Level Cache on an ItaniumTM Microprocessor. In: Proceedings of the IEEE International Solid-State Circuits Conference, San Francisco (February 2002)","DOI":"10.1109\/ISSCC.2002.992285"},{"key":"69_CR22","doi-asserted-by":"crossref","unstructured":"Sanders, P.: Fast priority queues for cached memory. ACM Journal of Experimental Algorithmics\u00a05 (2000)","DOI":"10.1145\/351827.384249"},{"key":"69_CR23","unstructured":"Sen, S., Chatterjee, S.: Towards a theory of cache-efficient algorithms. In: 11th ACM Symposium of Discrete Algorithms, pp. 829\u2013838 (2000)"},{"key":"69_CR24","doi-asserted-by":"crossref","unstructured":"Wickremesinghe, R., Arge, L., Chase, J.S., Vitter, J.S.: Efficient sorting using registers and caches. ACM Journal of Experimental Algorithmics\u00a07(9) (2002)","DOI":"10.1145\/944618.944627"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T22:38:46Z","timestamp":1740523126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}