{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:03Z","timestamp":1725664503026},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620341"},{"type":"electronic","value":"9783540496311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_50","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:31:56Z","timestamp":1330295516000},"page":"200-211","source":"Crossref","is-referenced-by-count":4,"title":["Tight bounds for prefetching and buffer management algorithms for parallel I\/O systems"],"prefix":"10.1007","author":[{"given":"Peter J.","family":"Varman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rakesh M.","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"18_CR1","first-page":"1","volume-title":"The influence of lookahead in competitive paging algorithms","author":"S. Albers","year":"1993","unstructured":"S. Albers. The influence of lookahead in competitive paging algorithms. In Proc. 1st European Symposium on Algorithms LNCS, Springer Verlag, Berlin, Germany 1993, pages 1\u201312, 1993."},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L. A. Belady","year":"1966","unstructured":"L. A. Belady. A Study of Replacement Algorithms for Virtual Storage. IBM Systems Journal, 5:78\u2013101, 1966.","journal-title":"IBM Systems Journal"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01294264","volume":"11","author":"S. Ben-David","year":"1994","unstructured":"S. Ben-David and A. Borodin. A New Measure for the Study of On-Line Algorithms. Algorithmica, 11:73\u201391, 1994.","journal-title":"Algorithmica"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"P. Cao, E. Felten, A. Karlin, and K. Li. A Study of Integrated Prefetching and Caching Strategies. In Proc. ACM SIGMETRICS Conference, 1995.","DOI":"10.1145\/223587.223608"},{"issue":"2","key":"18_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/176979.176981","volume":"26","author":"P. M. Chen","year":"1994","unstructured":"P. M. Chen, E. K. Lee, G. A. Gibson, R. H. Katz, and D. A. Patterson. RAID: High-Performance Reliable Secondary Storage. ACM Computing Surveys, 26(2):145\u2013185, 1994.","journal-title":"ACM Computing Surveys"},{"key":"18_CR6","volume-title":"Operating Systems Theory","author":"E. G. Coffman","year":"1973","unstructured":"E. G. Coffman and P. J. Denning. Operating Systems Theory. Addison-Wesley, Englewood Cliffs, N.J., 1973."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"D.Breslauer. On competitive on-line paging with lookahead. In Proc. Symposium Theor. Aspects of Computer Science, pages 593\u2013603, 1996.","DOI":"10.1007\/3-540-60922-9_48"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"A. Fiat, R. Karp, M.Luby, L. McGeoch, D. D. Sleator, and N. E. Young. Competitive Paging Algorithms. J. Algorithms, 12:685\u2013699, 1991.","journal-title":"J. Algorithms"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"E. Koutsoupias and C. H. Papadimitriou. Beyond competitive analysis. In Proc. 35th IEEE Symposium on Foundations of Computer Science, pages 394\u2013400, 1994.","DOI":"10.1109\/SFCS.1994.365677"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0304-3975(94)90170-8","volume":"12","author":"V. Pai","year":"1994","unstructured":"V. Pai, A. Sch\u00c4ffer, and P.Varman. Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging. Theo. Comp. Sci., 12:211\u2013239, 1994.","journal-title":"Theo. Comp. Sci."},{"issue":"2","key":"18_CR11","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. E. Tarzan. Amortized Efficiency of List Update and Paging Rules. Comm. ACM, 28(2):202\u2013208, 1985.","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:37:36Z","timestamp":1619573856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}