{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:19:39Z","timestamp":1742995179648,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662242"},{"type":"electronic","value":"9783540485230"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48523-6_62","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T12:06:31Z","timestamp":1197288391000},"page":"655-664","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Accessing Multiple Sequences Through Set Associative Caches"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,18]]},"reference":[{"key":"62_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-60220-8_74","volume-title":"4th Workshop on Algorithms and Data Structures","author":"L. Arge","year":"1995","unstructured":"L. Arge. The buffer tree: A new technique for optimal I\/O-algorithms. In 4th Workshop on Algorithms and Data Structures, number 955 in LNCS, pages 334\u2013345. Springer, 1995."},{"issue":"4","key":"62_CR2","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/S0167-8191(97)00015-X","volume":"23","author":"R.D. Barve","year":"1997","unstructured":"R.D. Barve, E.F. Grove, and J.S. Vitter. Simple randomized mergesort on parallel disks. Parallel Computing, 23(4):601\u2013631, 1997.","journal-title":"Parallel Computing"},{"key":"62_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BFb0054359","volume-title":"6th Scandinavian Workshop on Algorithm Theory","author":"G. St\u00f8lting Brodal","year":"1998","unstructured":"Gerth St\u00f8lting Brodal and Jyrki Katajainen. Worst-case efficient external-memory priority queues. In 6th Scandinavian Workshop on Algorithm Theory, number 1432 in LNCS, pages 107\u2013118. Springer Verlag, Berlin, 1998."},{"key":"62_CR4","unstructured":"A. Crauser, P. Ferragina, and U. Meyer. Efficient priority queues in external memory. working paper, October 1997."},{"issue":"2","key":"62_CR5","first-page":"72","volume":"19-","author":"R. Fadel","year":"1997","unstructured":"R. Fadel, K.V. Jakobsen, J. Katajainen, and J. Teuhola. External heaps combined with effective buffering. In 4th Australasian Theory Symposium, volume 19-2 of Australian Computer Science Communications, pages 72\u201378. Springer, 1997.","journal-title":"4th Australasian Theory Symposium"},{"key":"62_CR6","unstructured":"C. Fricker and P. Robert. An analytical cache model. Technical Report 1496, INRIA, Le Chesnay, 1991."},{"key":"62_CR7","unstructured":"J.L. Hennessy and D.A. Patterson. Computer Architecture a Quantitative Approach. Morgan Kaufmann, 1996."},{"key":"62_CR8","unstructured":"Intel Corporation, P.O. Box 5937, Denver, CO, 80217-9808, http:\/\/www.intel.com. Intel Archtecture Software Developer\u2019s Manual. Volume I: Basic Architecture, 1997. Ordering Number 2431-90."},{"key":"62_CR9","unstructured":"J. Keller. The 2126-4: A superscalar alpha processor with out-of-order execution. In Microprocessor Forum, October 1996."},{"key":"62_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/235141.235145","volume":"1","author":"Anthony LaMarca","year":"1996","unstructured":"A. LaMarca and R.E. Ladner. The influence of caches on the performance of heaps. ACM Journal of Experimental Algorithmics, 1(4), 1996.","journal-title":"Journal of Experimental Algorithmics"},{"key":"62_CR11","unstructured":"A. LaMarca and R.E. Ladner. The influence of caches on the performance of sorting. In 8th ACM-SIAM Symposium on Discrete Algorithm, pages 370\u2013379, 1997."},{"key":"62_CR12","unstructured":"MIPS Technologies, Inc. R1000-0 Microprocessor User\u2019s Manual, 2.0 edition, 1998. http:\/\/www.mips.com."},{"key":"62_CR13","doi-asserted-by":"crossref","unstructured":"J. von Neumann. First draft of a report on the EDVAC. Technical report, University of Pennsylvania, 1945.","DOI":"10.5479\/sil.538961.39088011475779"},{"key":"62_CR14","unstructured":"W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery. Numerical Recipes in C. Cambridge University Press, 2nd edition, 1992."},{"issue":"3","key":"62_CR15","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1145\/322077.322081","volume":"25","author":"G. Rao","year":"1978","unstructured":"G. Rao. Performance analysis of cache memories. Journal of the ACM, 25(3): 378\u2013395, 1978.","journal-title":"Journal of the ACM"},{"issue":"6","key":"62_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0020-0190(98)00127-6","volume":"67","author":"P. Sanders","year":"1998","unstructured":"P. Sanders. Random permutations on distributed, external and hierarchical memory. Information Processing Letters, 67(6):305\u2013310, 1998.","journal-title":"Information Processing Letters"},{"key":"62_CR17","series-title":"Lect Notes Comput Sci","volume-title":"ALENEX\u2019 99, Workshop on Algorithm Engineering and Experimentation","author":"P. Sanders","year":"1999","unstructured":"Peter Sanders. Fast priority queues for cached memory. In ALENEX\u2019 99, Workshop on Algorithm Engineering and Experimentation, LNCS. Springer, 1999."},{"key":"62_CR18","unstructured":"J. Sibeyn. From parallel to external list ranking. Technical Report MPI-I-97-1-021, Max-Planck Institut f\u00fcr Informatik, 1997."},{"key":"62_CR19","unstructured":"D.E. Vengroff. TPIE User Manual and Reference, 1995. http:\/\/www.cs.duke.edu\/~dev\/tpie_home_page.html."},{"key":"62_CR20","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"External memory algorithms","author":"J.S. Vitter","year":"1998","unstructured":"J.S. Vitter. External memory algorithms. In 6th European Symposium on Algorithms, number 1461 in LNCS, pages 1\u201325. Springer, 1998."},{"issue":"2-3","key":"62_CR21","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J.S. Vitter","year":"1994","unstructured":"J.S. Vitter and E.A.M. Shriver. Algorithms for parallel memory I: Two level memories. Algorithmica, 12(2-3):110\u2013147, 1994.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48523-6_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T03:10:52Z","timestamp":1642821052000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48523-6_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662242","9783540485230"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-48523-6_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"18 January 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}