{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:47Z","timestamp":1775282327749,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1007\/bf01185207","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:46:54Z","timestamp":1108730814000},"page":"110-147","source":"Crossref","is-referenced-by-count":205,"title":["Algorithms for parallel memory, I: Two-level memories"],"prefix":"10.1007","volume":"12","author":[{"given":"J. S.","family":"Vitter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. A. M.","family":"Shriver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"BF01185207_CR1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal and J. S. Vitter, The Input\/Output Complexity of Sorting and Related Problems,Communications of the ACM 31(9) (September 1988), 1116\u20131127.","journal-title":"Communications of the ACM"},{"issue":"4","key":"BF01185207_CR2","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"M, Blum, R. W. Floyd, V. Pratt, R. Rivest, and R. E. Tarjan, Time Bounds for Selection,Journal of Computer and System Sciences 7(4) (1973), 448\u2013461.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF01185207_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N. Wegman, Universal Classes of Hash Functions,Journal of Computer and System Sciences 18 (April 1979), 143\u2013154.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF01185207_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-1-4684-2001-2_10","volume-title":"Complexity of Computer Calculations","author":"R. W. Floyd","year":"1972","unstructured":"R. W. Floyd, Permuting Information in Idealized Two-Level Storage, inComplexity of Computer Calculations, R. Miller and J. Thatcher, eds., Plenum, New York, 1972, pp. 105\u2013109."},{"key":"BF01185207_CR5","doi-asserted-by":"crossref","unstructured":"L. Hellerstein, G. A. Gibson, R. M. Karp, R. H. Katz, and D. A. Patterson, Coding Techniques for Handling Failures in Large Disk Arrays,Algorithmica, this issue, pp. 182\u2013208.","DOI":"10.1007\/BF01185210"},{"key":"BF01185207_CR6","unstructured":"W. Jilke, Disk Array Mass Storage Systems: The New Opportunity, Amperif Corporation, September 1986."},{"key":"BF01185207_CR7","volume-title":"Queueing Systems, Vol. I","author":"L. Kleinrock","year":"1979","unstructured":"L. Kleinrock,Queueing Systems, Vol. I, Wiley, New York, 1979."},{"key":"BF01185207_CR8","volume-title":"The Art of Computer Programming, Vol. 3","author":"D. Knuth","year":"1973","unstructured":"D. Knuth,The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA, 1973."},{"key":"BF01185207_CR9","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TC.1985.5009385","volume":"34","author":"F. T. Leighton","year":"1985","unstructured":"F. T. Leighton, Tight Bounds on the Complexity of Parallel Sorting,IEEE Transactions on Computers 34 (April 1985), 344\u2013354.","journal-title":"IEEE Transactions on Computers"},{"key":"BF01185207_CR10","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/TC.1985.1676565","volume":"34","author":"E. E. Lindstrom","year":"1985","unstructured":"E. E. Lindstrom and J. S. Vitter, The Design and Analysis of BucketSort for Bubble Memory Secondary Storage,IEEE Transactions on Computers 34 (March 1985), 218\u2013233.","journal-title":"IEEE Transactions on Computers"},{"key":"BF01185207_CR11","unstructured":"N. B. Maginnis, Store More, Spend Less: Mid-Range Options Around,Computerworld, November 16, 1986, p. 71."},{"key":"BF01185207_CR12","doi-asserted-by":"crossref","unstructured":"M. H. Nodine and J. S. Vitter, Large-Scale Sorting in Parallel Memories,Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, July 1991, pp. 29\u201339.","DOI":"10.1145\/113379.113382"},{"key":"BF01185207_CR13","doi-asserted-by":"crossref","unstructured":"M. H. Nodine and J. S. Vitter, Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors,Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, July 1993, pp. 120\u2013129.","DOI":"10.1145\/165231.165247"},{"key":"BF01185207_CR14","doi-asserted-by":"crossref","unstructured":"D. A. Patterson, G. Gibson, and R. H. Katz, A Case for Redundant Arrays of Inexpensive Disks (RAID),Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, June 1988, pp. 109\u2013116.","DOI":"10.1145\/971701.50214"},{"key":"BF01185207_CR15","first-page":"117","volume-title":"Advances in Computing Research, Vol. 4","author":"J. Savage","year":"1987","unstructured":"J. Savage and J. S. Vitter, Parallelism in Space-Time Tradeoffs, inAdvances in Computing Research, Vol. 4, F. P. Preparata, ed., JAI Press, Greenwich, CT, 1987, pp. 117\u2013146."},{"key":"BF01185207_CR16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","volume":"20","author":"H. S. Stone","year":"1971","unstructured":"H. S. Stone, Parallel Processing with the Perfect Shuffle,IEEE Transactions on Computers 20 (February 1971), 153\u2013161.","journal-title":"IEEE Transactions on Computers"},{"key":"BF01185207_CR17","unstructured":"University of California, Massive Information Storage, Management, and Use (NSF Institutional Infrastructure Proposal), Technical Report No. UCB\/CSD 89\/493, University of California at Berkeley, January 1989."},{"key":"BF01185207_CR18","first-page":"431","volume-title":"Handbook of Theoretical Computer Science","author":"J. S. Vitter","year":"1990","unstructured":"J. S. Vitter and Ph. Flajolet, Average-Case Analysis of Algorithms and Data Structures, inHandbook of Theoretical Computer Science, Jan van Leeuwen, ed., North-Holland, Amsterdam, 1990, pp. 431\u2013524."},{"key":"BF01185207_CR19","doi-asserted-by":"crossref","unstructured":"J. S. Vitter and E. A. M. Shriver, Algorithms for Parallel Memory, II: Hierarchical Multilevel Memories,Algorithmica, this issue, pp. 148\u2013169.","DOI":"10.1007\/BF01185208"},{"key":"BF01185207_CR20","first-page":"324","volume":"30","author":"C. Wu","year":"1981","unstructured":"C. Wu and T. Feng, The Universality of the Shuffle-Exchange Network,IEEE Transactions on Computers 30 (May 1981), 324\u2013332.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185207.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01185207\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185207","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:00:38Z","timestamp":1586120438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01185207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":20,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["BF01185207"],"URL":"https:\/\/doi.org\/10.1007\/bf01185207","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}