{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:56:30Z","timestamp":1759146990148,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540537090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0020785","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:07:52Z","timestamp":1131862072000},"page":"26-41","source":"Crossref","is-referenced-by-count":5,"title":["Efficient memory access in large-scale computation"],"prefix":"10.1007","author":[{"given":"Jeffrey Scott","family":"Vitter","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, B. Alpern, A. K. Chandra and M. Snir, \u201cA Model for Hierarchical Memory,\u201d Proceedings of 19th Annual ACM Symposium on Theory of Computing (May 1987), 305\u2013314.","DOI":"10.1145\/28395.28428"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"A. Aggarwal and A. Chandra, \u201cVirtual Memory Algorithms,\u201d Proceedings of 20th Annual ACM Symposium on Theory of Computing (May 1988), 173\u2013185.","DOI":"10.1145\/62212.62227"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, A. Chandra and M. Snir, \u201cHierarchical Memory with Block Transfer,\u201d Proceedings of 28th Annual IEEE Symposium on Foundations of Computer Science (October 1987), 204\u2013216.","DOI":"10.1109\/SFCS.1987.31"},{"key":"3_CR4","first-page":"1116","volume-title":"Communications of the ACM (September 1988)","author":"A. Aggarwal","year":"1987","unstructured":"A. Aggarwal and J. S. Vitter, \u201cThe Input\/Output Complexity of Sorting and Related Problems,\u201d Communications of the ACM (September 1988), 1116\u20131127, also appears in Proceedings of 14th Annual International Colloquium on Automata, Languages, and Programming, LNCS 267, Springer-Verlag, Berlin, 1987."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"B. Alpern, L. Carter and E. Feig, \u201cUniform Memory Hierarchies,\u201d Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (October 1990), 600\u2013608.","DOI":"10.1109\/FSCS.1990.89581"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"B. Alpern, L. Carter and T. Selker, \u201cVisualizing Computer Memory Architectures,\u201d Proceedings of the 1990 IEEE Visualization Conference (October 1990).","DOI":"10.1109\/VISUAL.1990.146371"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"R. W. Floyd, \u201cPermuting Information in Idealized Two-Level Storage,\u201d in Complexity of Computer Calculations, R. Miller and J. Thatcher, ed., Plenum, 1972, 105\u2013109.","DOI":"10.1007\/978-1-4684-2001-2_10"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"J. W. Hong and H. T. Kung, \u201cI\/O Complexity: The Red-Blue Pebble Game,\u201d Proc. of the 13th Annual ACM Symposium on the Theory of Computing (May 1981), 326\u2013333.","DOI":"10.1145\/800076.802486"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"C. Icking, R. Klein and T. Ottmann, \u201cPriority Search Trees in Secondary Memory,\u201d Graph-Theoretic Concepts in Computer Science, Proceedings of the International Workshop WG '87 (1988), 84\u201393.","DOI":"10.1007\/3-540-19422-3_7"},{"key":"3_CR10","volume-title":"The Art of Computer Programming, Volume 3: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"D. Knuth, in The Art of Computer Programming, Volume 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"T. Leighton, \u201cTight Bounds on the Complexity of Parallel Sorting,\u201d IEEE Transactions on Computers C-34 (April 1985), 344\u2013354, also appears in Proceedings of the 16th Annual ACM Symposium on Theory of Computing, (April 1983), 71\u201380.","DOI":"10.1109\/TC.1985.5009385"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/TC.1985.1676565","volume":"C-34","author":"E. E. Lindstrom","year":"1985","unstructured":"E. E. Lindstrom and J. S. Vitter, \u201cThe Design and Analysis of BucketSort for Bubble Memory Secondary Storage,\u201d IEEE Transactions on Computers C-34 (March 1985), 218\u2013233.","journal-title":"IEEE Transactions on Computers"},{"key":"3_CR13","unstructured":"F. Luccio and L. Pagli, \u201cA Model of Sequential Computation Based on a Pipelined Access to Memory,\u201d Proceedings of the 27th Annual Allerton Conference on Communication, Control, and Computing (September 1989)."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"M. H. Nodine, D. P. Lopresti and J. S. Vitter, \u201cI\/O Overhead and Parallel VLSI Architectures for Lattice Computations,\u201d IEEE Transactions on Computers (to appear), also appears in Proceedings of the International Conference on Computers and Information, Niagara Falls (May 1990).","DOI":"10.1007\/3-540-53504-7_108"},{"key":"3_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F.P. Preparata","year":"1985","unstructured":"F.P. Preparata and M.I. Shamos, Computational Geometry, Springer-Verlag, New York, 1985."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"J. H. Reif and L. G. Valiant, \u201cA Logarithmic Time Sort on Linear Size Networks,\u201d Journal of the ACM 34 (January 1987), 60\u201376, also appears in Proceedings of the 15th Annual ACM Symposium on Theory of Computing (April 1983), 10\u201316.","DOI":"10.1145\/7531.7532"},{"key":"3_CR17","unstructured":"J. Savage and J. S. Vitter, \u201cParallelism in Space-Time Tradeoffs,\u201d in Advances in Computing Research, Volume 4, F. P. Preparata, ed., JAI Press, 1987, 117\u2013146, also appears in Proceedings of the International Workshop on Parallel Computing and VLSI, Amalfi, Italy (May 1984), P. Bertolazzi and F. Luccio, ed., Elsevier Science Press, 1985, 49\u201358."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"J. D. Ullman and M. Yannakakis, \u201cThe Input\/Output Complexity of Transitive Closure,\u201d Proceedings of the 1990 ACM-SIGMOD International Conference on Management of Data (1990), 44\u201353, also appears in a special issue of Annals of Mathematics and Artificial Intelligence, S. Naqvi, ed., to appear.","DOI":"10.1145\/93597.93620"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"J. S. Vitter and Ph. Flajolet, \u201cAverage-Case Analysis of Algorithms and Data Structures,\u201d in Handbook of Theoretical Computer Science, Jan van Leeuwen, ed., North-Holland, 1990, 431\u2013524.","DOI":"10.1016\/B978-0-444-88071-0.50014-X"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"J. S. Vitter and E. A. M. Shriver, \u201cOptimal Disk I\/O with Parallel Block Transfer,\u201d Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (May 1990), 159\u2013169.","DOI":"10.1145\/100216.100234"}],"container-title":["Lecture Notes in Computer Science","STACS 91"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020785.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:00:25Z","timestamp":1736082025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540537090"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0020785","relation":{},"subject":[]}}