{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:34:18Z","timestamp":1743154458698,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":16,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_137","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:36:25Z","timestamp":1214505385000},"page":"291-297","source":"Crossref","is-referenced-by-count":0,"title":["External Sorting and Permuting"],"prefix":"10.1007","author":[{"given":"Jeffrey Scott","family":"Vitter","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"137_CR1_137","first-page":"659","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, vol. 5","author":"A. Aggarwal","year":"1994","unstructured":"Aggarwal, A., Plaxton, C.G.: Optimal parallel sorting in multi-level storage. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, vol.\u00a05, pp.\u00a0659\u2013668. ACM Press, New York (1994)"},{"key":"137_CR2_137","first-page":"1116","volume-title":"Communications of the ACM, 31 (1988)","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The Input\/Output complexity of sorting and related problems. In: Communications of the ACM, 31 (1988), pp.\u00a01116\u20131127. ACM Press, New York (1988)"},{"key":"137_CR3_137","doi-asserted-by":"crossref","unstructured":"Arge, L., Knudsen, M., Larsen, K.: A\u00a0general lower bound on the I\/O-complexity of comparison-based algorithms. In: Proceedings of the Workshop on Algorithms and Data Structures. Lect. Notes Comput. Sci. 709, 83\u201394 (1993)","DOI":"10.1007\/3-540-57155-8_238"},{"key":"137_CR4_137","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1006\/jagm.2000.1089","volume":"36","author":"R.D. Barve","year":"2000","unstructured":"Barve, R.D., Kallahalla, M., Varman, P.J., Vitter, J.S.: Competitive analysis of buffer management algorithms. J.\u00a0Algorithms 36, 152\u2013181 (2000)","journal-title":"J. Algorithms"},{"key":"137_CR5_137","first-page":"189","volume":"35","author":"R.D. Barve","year":"2002","unstructured":"Barve, R.D., Vitter, J.S.: A\u00a0simple and efficient parallel disk mergesort. ACM Trans. Comput. Syst. 35, 189\u2013215 (2002)","journal-title":"ACM Trans. Comput. Syst."},{"key":"137_CR6_137","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1137\/S0097539795283681","volume":"28","author":"T.H. Cormen","year":"1999","unstructured":"Cormen, T.H., Sundquist, T., Wisniewski, L.F.: Asymptotically tight bounds for performing BMMC permutations on parallel disk systems. SIAM J. Comput. 28, 105\u2013136 (1999)","journal-title":"SIAM J. Comput."},{"key":"137_CR7_137","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1137\/S0097539703431573","volume":"34","author":"D.A. Hutchinson","year":"2005","unstructured":"Hutchinson, D.A., Sanders, P., Vitter, J.S.: Duality between prefetching and queued writing with parallel disks. SIAM J. Comput. 34, 1443\u20131463 (2005)","journal-title":"SIAM J. Comput."},{"key":"137_CR8_137","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s00453-004-1129-7","volume":"43","author":"M. Kallahalla","year":"2005","unstructured":"Kallahalla, M., Varman, P.J.: Optimal read-once parallel disk scheduling. Algorithmica 43, 309\u2013343 (2005)","journal-title":"Algorithmica"},{"key":"137_CR9_137","volume-title":"Sorting and Searching. The Art of Computer Programming, vol. 3","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: Sorting and Searching. The Art of Computer Programming, vol.\u00a03, 2nd\u00a0edn. Addison-Wesley, Reading (1998)","edition":"2"},{"issue":"2","key":"137_CR10_137","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1137\/S0097539704446554","volume":"36","author":"Y. Matias","year":"2006","unstructured":"Matias, Y., Segal, E., Vitter, J.S.: Efficient bundle sorting. SIAM J. Comput. 36(2), 394\u2013410 (2006)","journal-title":"SIAM J. Comput."},{"key":"137_CR11_137","doi-asserted-by":"crossref","unstructured":"Nodine, M.H., Vitter, J.S.: Deterministic distribution sort in shared and distributed memory multiprocessors. In: Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, June\u2013July 1993, vol.\u00a05, pp.\u00a0120\u2013129, ACM Press, New York (1993)","DOI":"10.1145\/165231.165247"},{"key":"137_CR12_137","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: An optimal sorting algorithm for multiple disks. J.\u00a0ACM 42, 919\u2013933 (1995)","journal-title":"J. ACM"},{"key":"137_CR13_137","first-page":"255","volume-title":"Proceedings of the ACM Symposium on Parallel Algorithms and Architectures","author":"R. Shah","year":"2004","unstructured":"Shah, R., Varman, P.J., Vitter, J.S.: Online algorithms for prefetching and caching on parallel disks. In: Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pp.\u00a0255\u2013264. ACM Press, New York (2004)"},{"issue":"2","key":"137_CR14_137","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J.S. Vitter","year":"2001","unstructured":"Vitter, J.S.: External memory algorithms and data structures: Dealing with Massive Data. ACM Comput. Surv. 33(2), 209\u2013271 (2001) Revised version available at http:\/\/www.cs.purdue.edu\/homes\/jsv\/Papers\/Vit.IO_survey.pdf","journal-title":"ACM Comput. Surv."},{"key":"137_CR15_137","doi-asserted-by":"crossref","unstructured":"Vitter, J.S., Hutchinson, D.A.: Distribution sort with randomized cycling. J.\u00a0ACM. 53 (2006)","DOI":"10.1145\/1162349.1162352"},{"key":"137_CR16_137","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J.S. Vitter","year":"1994","unstructured":"Vitter, J.S., Shriver, E.A.M.: Algorithms for parallel memory I: Two-level memories. Algorithmica 12, 110\u2013147 (1994)","journal-title":"Algorithmica"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T02:13:42Z","timestamp":1662171222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_137"}},"subtitle":["1988; Aggarwal, Vitter"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_137","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}