{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T08:14:49Z","timestamp":1648714489620},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,7,8]],"date-time":"2005-07-08T00:00:00Z","timestamp":1120780800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2005,10]]},"DOI":"10.1007\/s00236-005-0170-6","type":"journal-article","created":{"date-parts":[[2005,7,22]],"date-time":"2005-07-22T15:57:09Z","timestamp":1122047829000},"page":"21-42","source":"Crossref","is-referenced-by-count":0,"title":["Enhanced prefetching and caching strategies for single- and multi-disk systems"],"prefix":"10.1007","volume":"42","author":[{"given":"Markus","family":"B\u00fcttner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,8]]},"reference":[{"key":"170_CR1","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1145\/355541.355542","volume":"47","author":"S. Albers","year":"2000","unstructured":"Albers, S., Garg, N., Leonardi, S.: Minimizing stall time in single and parallel disk systems. Journal of the ACM 47, 969\u2013986 (2000)","journal-title":"Journal of the ACM"},{"key":"170_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S., Witt, C.: Minimizing stall time in single and parallel disk systems using multicommodity network flows. In: Proc. 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 12\u201323. Springer LNCS 2129 (2001)","DOI":"10.1007\/3-540-44666-4_6"},{"key":"170_CR3","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L.A. Belady","year":"1966","unstructured":"Belady, L.A.: A study of replacement algorithms for virtual storage computers. IBM Systems Journal 5, 78\u2013101 (1966)","journal-title":"IBM Systems Journal"},{"key":"170_CR4","unstructured":"El-Yaniv, B.: Online Computation and Competitive Analysis. Cambrige University Press (1998)"},{"key":"170_CR5","doi-asserted-by":"crossref","unstructured":"Cao, P., Felten, E.W., Karlin, A.R., Li, K.: A study of integrated prefetching and caching strategies. In: Proc. ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) pp. 188\u2013196 (1995)","DOI":"10.1145\/223587.223608"},{"key":"170_CR6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1145\/235543.235544","volume":"14","author":"P. Cao","year":"1996","unstructured":"Cao, P., Felten, E.W., Karlin, A.R., Li, K.: Implementation and performance of integrated application-controlled caching, prefetching and disk scheduling. ACM Transaction on Computer Systems (TOCS) 14, 311\u2013343 (1996)","journal-title":"ACM Transaction on Computer Systems (TOCS)"},{"key":"170_CR7","doi-asserted-by":"crossref","unstructured":"Gaysinsky, A., Itai, A., Shachnai, H.: Strongly competitive algorithms for caching with pipelined prefetching. In Proc. of the 9th Annual European Symposium on Algorithms (ESA01), pp. 49\u201361, Springer LNCS 2161 (2001)","DOI":"10.1007\/3-540-44676-1_4"},{"key":"170_CR8","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1137\/S0097539797326976","volume":"29","author":"T. Kimbrel","year":"2000","unstructured":"Kimbrel, T., Karlin, A.R.: Near-optimal parallel prefetching and caching. SIAM Journal on Computing 29, 1051\u20131082 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"170_CR9","doi-asserted-by":"crossref","unstructured":"Kimbrel, T., Cao, P., Felten, E.W., Karlin, A.R., Li, K.: Integrated parallel prefetching and caching. In: Proc. ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) (1996)","DOI":"10.1145\/233013.233052"},{"key":"170_CR10","doi-asserted-by":"crossref","unstructured":"Kimbrel, T., Tomkins, A., Patterson, R.H., Bershad, B., Cao, P., Felten, E.W., Gibson, G.A., Karlin, A.R., Li, K.: A trace-driven comparison of algorithms for parallel prefetching and caching. In: Proc. of the ACM SIGOPS\/USENIX Association Symposium on Operating System Design and Implementation (1996)","DOI":"10.1145\/238721.238737"},{"key":"170_CR11","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"S. Tarjan","year":"1985","unstructured":"Tarjan, S.: Amortized efficiency of list update and paging rules. CACM 28, 202\u2013208 (1985)","journal-title":"CACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0170-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-005-0170-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0170-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:52Z","timestamp":1558705312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-005-0170-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,8]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["170"],"URL":"https:\/\/doi.org\/10.1007\/s00236-005-0170-6","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7,8]]}}}