{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:08:36Z","timestamp":1725491316557},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75142-7_29","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T10:00:46Z","timestamp":1188986446000},"page":"373-387","source":"Crossref","is-referenced-by-count":6,"title":["Cost-Aware Caching Algorithms for Distributed Storage Servers"],"prefix":"10.1007","author":[{"given":"Shuang","family":"Liang","sequence":"first","affiliation":[]},{"given":"Ke","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Song","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Xiaodong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"29_CR1","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/TC.2005.130","volume":"54","author":"S. Jiang","year":"2005","unstructured":"Jiang, S., Zhang, X.: Making LRU friendly to weak locality workloads: A novel replacement algorithm to improve buffer cache performance. IEEE Trans. on Comp.\u00a054(8), 939\u2013952 (2005)","journal-title":"IEEE Trans. on Comp."},{"key":"29_CR2","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1995.0805","volume":"22","author":"A.V. Goldberg","year":"1997","unstructured":"Goldberg, A.V.: An efficient implementation of a scaling minimum-cost flow algorithm. J. Algorithms\u00a022(1), 1\u201329 (1997)","journal-title":"J. Algorithms"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L. Belady","year":"1966","unstructured":"Belady, L.: A study of replacement algorithms for virtual storage computers. IBM Sys. J.\u00a05, 78\u2013101 (1966)","journal-title":"IBM Sys. J."},{"key":"29_CR5","unstructured":"Storage Performance Council: SPC I\/O Traces. Available at http:\/\/www.storageperformance.org"},{"key":"29_CR6","first-page":"82","volume-title":"Proc. 9th Annu. ACM-SIAM sympos. Discrete algorithms","author":"N.E. Young","year":"1998","unstructured":"Young, N.E.: On-line file caching. In: Proc. 9th Annu. ACM-SIAM sympos. Discrete algorithms, pp. 82\u201386. ACM Press, New York (1998)"},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M. Chrobak","year":"1991","unstructured":"Chrobak, M., Karloff, H., Payne, T., Vishwanathan, S.: New results on server problems. SIAM J. Discret. Math.\u00a04(2), 172\u2013181 (1991)","journal-title":"SIAM J. Discret. Math."},{"key":"29_CR8","volume-title":"Computer architecture: a quantitative approach","author":"D.A. Patterson","year":"1990","unstructured":"Patterson, D.A., Hennessy, J.L.: Computer architecture: a quantitative approach. Morgan Kaufmann, San Francisco (1990)"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Liang, S., Zhang, X., Jiang, S.: Cost-aware caching algorithms for distributed storage servers. Technical Report OSU-CISRC-3\/07-TR23 (2007)","DOI":"10.1007\/978-3-540-75142-7_29"},{"key":"29_CR10","unstructured":"Forney, B., Arpaci-Dusseau, A.C., Arpaci-Dusseau, R.H.: Storage-aware caching: Revisiting caching for heterogeneous storage systems. In: Proc. 1st USENIX Sympos. File and Storage Tech., pp. 61\u201374 (2002)"},{"key":"29_CR11","unstructured":"Cao, P., Irani, S.: Cost-aware WWW proxy caching algorithms. In: Proc. 1997 Usenix Sympos. on Internet Tech. Sys. (1997)"},{"issue":"6","key":"29_CR12","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/BF01189992","volume":"11","author":"N.E. Young","year":"1994","unstructured":"Young, N.E.: The k-server dual and loose competitiveness for paging. Algorithmica\u00a011(6), 525\u2013541 (1994)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T21:36:10Z","timestamp":1684013770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540751410","9783540751427"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}