{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:10:03Z","timestamp":1751634603919,"version":"3.41.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Scheduling"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1022989909868","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T22:16:51Z","timestamp":1049753811000},"page":"149-166","source":"Crossref","is-referenced-by-count":7,"title":["On-line Restricted Caching"],"prefix":"10.1007","volume":"6","author":[{"given":"Mark","family":"Brehob","sequence":"first","affiliation":[]},{"given":"Richard","family":"Enbody","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Torng","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5117038_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"E. A. Arkin","year":"1987","unstructured":"Arkin, E. A. and E. B. Silverberg, \u201cScheduling jobs with fixed start and end times,\u201d Discrete Appl. Math., 18, 1-8 (1987).","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"5117038_CR2","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L. A. Belady","year":"1966","unstructured":"Belady, L. A., \u201cA study of replacement algorithms for a virtual-storage computer,\u201d IBM Syst. J., 5(2), 282-288 (1966).","journal-title":"IBM Syst. J."},{"key":"5117038_CR3","doi-asserted-by":"crossref","unstructured":"Borodin, A., S. Irani, P. Raghavan, and B. Schieber, \u201cCompetitive paging with locality of reference,\u201d in Proc. 23rd ACM Symp. on Theory of Computing, 1991, pp. 249-259.","DOI":"10.1145\/103418.103422"},{"key":"5117038_CR4","series-title":"Technical Report","volume-title":"Optimal replacement is NP-hard for non-standard caches","author":"M. Brehob","year":"2000","unstructured":"Brehob, M., S. Wagner, E. Torng, and R. Enbody, \u201cOptimal replacement is NP-hard for non-standard caches,\u201d Technical Report MSU-CSE-00-14. Department of Computer Science, Michigan State University, East Lansing, Michigan, June, 2000."},{"key":"5117038_CR5","unstructured":"Chan, K. K., C. C. Hay, J. R. Keller, G. P. Kurpanek, F. X. Schumacher, and J. Zheng, \u201cDesign of the hp pa7200,\u201d Hewlett-Packard J. (February, 1996)."},{"key":"5117038_CR6","doi-asserted-by":"crossref","unstructured":"Fiat, A. and A. Karlin, \u201cRandomized and multipointer paging with locality of reference,\u201d in Proc. 27th Annu. ACM Symp. on the Theory of Computing, 1995, pp. 626-634.","DOI":"10.1145\/225058.225280"},{"key":"5117038_CR7","unstructured":"Fiat, A. and Z. Rosen, \u201cExperimental studies of access graph based heuristics: Beating the LRU standard?,\u201d in Proc. 8th Annu. ACM-SIAM Symp. on Discrete Algorithms, 1997, pp. 63-72."},{"key":"5117038_CR8","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"Fiat, A., R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young, \u201cCompetitive paging algorithms,\u201d J. Algorithms, 12, 685-699 (1991).","journal-title":"J. Algorithms"},{"key":"5117038_CR9","unstructured":"Irani, S. S., A. R. Karlin, and S. J. Phillips, \u201cStrongly competitive algorithms for paging with locality of reference,\u201d in 3rd ACM-SIAM Symp. on Discrete Algorithms, 1992, pp. 228-236."},{"issue":"2","key":"5117038_CR10","first-page":"364","volume":"18","author":"N. Jouppi","year":"1990","unstructured":"Jouppi, N., \u201cImproving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers\u201d Proc. 17th Annu. Inter. Symp. on Comput. Architecture, 18(2), 364-373 (May, 1990).","journal-title":"Proc. 17th Annu. Inter. Symp. on Comput. Architecture"},{"key":"5117038_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0377-2217(91)90320-U","volume":"54","author":"A. W. J. Kolen","year":"1991","unstructured":"Kolen, A. W. J. and J. G. Kroon, \u201cOn the computation complexity of (maximum) class scheduling,\u201d Eur. J. Operational Res., 54, 23-38 (1991).","journal-title":"Eur. J. Operational Res."},{"key":"5117038_CR12","doi-asserted-by":"crossref","unstructured":"Lund, C., S. Phillips, and N. Reingold, \u201cIP over connection-oriented networks and distributional paging,\u201d in Proc. 35th Annu. IEEE Foundations of Comput. Sci., 1994, pp. 424-434.","DOI":"10.1109\/SFCS.1994.365674"},{"key":"5117038_CR13","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"L. L. McGeoch","year":"1991","unstructured":"McGeoch, L. L. and D. D. Sleator, \u201cA strongly competitive randomized paging algorithm,\u201d Algorithmica, 6, 816-825 (1991).","journal-title":"Algorithmica"},{"key":"5117038_CR14","doi-asserted-by":"crossref","unstructured":"Seznec, A., \u201cA case for two-way skewed-associative caches,\u201d in Proc. 20th Inter. Symp. on Computer Architecture, 1993, pp. 169-178.","DOI":"10.1145\/165123.165152"},{"key":"5117038_CR15","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. D. Sleator","year":"1985","unstructured":"Sleator, D. D. and R. E. Tarjan, \u201cAmortized efficiency of list update and paging rules,\u201d CACM, 28, 202-208 (1985).","journal-title":"CACM"},{"key":"5117038_CR16","doi-asserted-by":"crossref","unstructured":"Tam, E. S., J. A. Rivers, V. Srinivasan, G. S. Tyson, and E. S. Davidson, \u201cActive management of data caches by exploiting reuse information,\u201d IEEE Trans. Comput., 48(11) (November 1999).","DOI":"10.1109\/12.811113"},{"key":"5117038_CR17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/PL00009192","volume":"20","author":"E. Torng","year":"1998","unstructured":"Torng, E., \u201cA unified analysis of paging and caching,\u201d Algorithmica, 20, 175-200 (1998).","journal-title":"Algorithmica"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022989909868.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022989909868\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022989909868.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T12:52:00Z","timestamp":1751633520000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022989909868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5117038"],"URL":"https:\/\/doi.org\/10.1023\/a:1022989909868","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}