{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:08Z","timestamp":1775282288852,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"4-5","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0167-8191(97)00015-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:15:57Z","timestamp":1027602957000},"page":"601-631","source":"Crossref","is-referenced-by-count":60,"title":["Simple randomized mergesort on parallel disks"],"prefix":"10.1016","volume":"23","author":[{"given":"Rakesh D.","family":"Barve","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward F.","family":"Grove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Scott","family":"Vitter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(97)00015-X_BIB1","series-title":"Proceedings of the Fifth Annual ACM-SIAM Symp. on Discrete Algorithms","first-page":"659","article-title":"Optimal parallel sorting in multi-level storage","author":"Aggarwal","year":"1994"},{"issue":"9","key":"10.1016\/S0167-8191(97)00015-X_BIB2","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","article-title":"The input\/output complexity of sorting and related problems","volume":"31","author":"Aggarwal","year":"1988","journal-title":"Commun. ACM"},{"key":"10.1016\/S0167-8191(97)00015-X_BIB3","series-title":"Complexity of Computer Computations","first-page":"105","article-title":"Permuting information in idealized two-level storage","author":"Floyd","year":"1972"},{"key":"10.1016\/S0167-8191(97)00015-X_BIB4","series-title":"Mathematics for the Analysis of Algorithms","author":"Greene","year":"1981"},{"issue":"7","key":"10.1016\/S0167-8191(97)00015-X_BIB5","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/358105.358192","article-title":"The TWA reservation system","volume":"27","author":"Gifford","year":"1984","journal-title":"Commun. ACM"},{"issue":"2\u20133","key":"10.1016\/S0167-8191(97)00015-X_BIB6","article-title":"Coding techniques for handling failures in large disk arrays","volume":"12","author":"Hellerstein","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-8191(97)00015-X_BIB7","series-title":"Proceedings of the 13th Annual ACM Symp. on Theory of Computation","first-page":"326","article-title":"I\/O complexity: The red-blue pebble game","author":"Hong","year":"1981"},{"key":"10.1016\/S0167-8191(97)00015-X_BIB8","article-title":"Sorting and Searching","volume":"vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/S0167-8191(97)00015-X_BIB9","series-title":"Random Allocations","author":"Kolchin","year":"1978"},{"key":"10.1016\/S0167-8191(97)00015-X_BIB10","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/TC.1985.1676565","article-title":"The design and analysis of bucketsort for bubble memory secondary storage","volume":"C-34","author":"Lindstrom","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8191(97)00015-X_BIB11","first-page":"71","article-title":"Store more, spend less: Mid-range options abound","author":"Maginnis","year":"1987","journal-title":"Computer-world"},{"key":"10.1016\/S0167-8191(97)00015-X_BIB12","series-title":"Proceedings of the 3rd ACM Symp. on Parallel Algorithms and Architectures","first-page":"29","article-title":"Large-scale sorting in parallel memories","author":"Nodine","year":"1990"},{"key":"10.1016\/S0167-8191(97)00015-X_BIB13","series-title":"Proceedings of the 5th Annual ACM Symp. on Parallel Algorithms and Architectures","first-page":"120","article-title":"Deterministic distribution sort in shared and distributed memory multiprocessors","author":"Nodine","year":"1993"},{"key":"10.1016\/S0167-8191(97)00015-X_BIB14","series-title":"Proceedings of the 1988 ACM-SIGMOD Conf. on Management of Data","first-page":"109","article-title":"A case for redundant arrays of inexpensive disks (raid)","author":"Patterson","year":"1988"},{"issue":"2","key":"10.1016\/S0167-8191(97)00015-X_BIB15","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0304-3975(94)90170-8","article-title":"Markov analysis of multiple-disk prefetching strategies for external merging","volume":"128","author":"Pai","year":"1994","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0167-8191(97)00015-X_BIB16","first-page":"17","article-title":"An introduction to disk drive modeling","author":"Ruemmler","year":"1994"},{"key":"10.1016\/S0167-8191(97)00015-X_BIB17","article-title":"Massive Information Storage, Management and Use (NSF Institutional Infrastructure Proposal)","author":"University of California at Berkeley","year":"1989","journal-title":"Technical Report No. UCB\/CSD 89\/493"},{"key":"10.1016\/S0167-8191(97)00015-X_BIB18","series-title":"Algorithms and Complexity","first-page":"431","article-title":"Average-case analysis of algorithms and data structures","volume":"vol. A","author":"Vitter","year":"1990"},{"issue":"23","key":"10.1016\/S0167-8191(97)00015-X_BIB19","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/BF01185207","article-title":"Algorithms for parallel memory 1: Two-level memories","volume":"12","author":"Vitter","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-8191(97)00015-X_BIB20","series-title":"Proceedings of the Goddard Conference on Mass Storage Systems and Technologies","article-title":"Io-efficient computation: The tpie approach","author":"Vengroff","year":"1996"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781919700015X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781919700015X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T18:28:53Z","timestamp":1556562533000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016781919700015X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":20,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S016781919700015X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(97)00015-x","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}