{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:32:16Z","timestamp":1761489136161},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642380150"},{"type":"electronic","value":"9783642380167"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38016-7_13","type":"book-chapter","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T17:58:58Z","timestamp":1367344738000},"page":"145-158","source":"Crossref","is-referenced-by-count":1,"title":["Minimizing Cache Usage in Paging"],"prefix":"10.1007","author":[{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Salinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Lemon graph library, \n                    \n                      http:\/\/lemon.cs.elte.hu\/trac\/lemon"},{"key":"13_CR2","unstructured":"Trace reduction for virtual memory simulation, \n                    \n                      http:\/\/www.cs.amherst.edu\/sfkaplan\/research\/trace-reduction\/index.html"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"E.M. Arkin","year":"1987","unstructured":"Arkin, E.M., Silverberg, E.B.: Scheduling jobs with fixed start and end times. Discrete Appl. Math.\u00a018(1), 1\u20138 (1987)","journal-title":"Discrete Appl. Math."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1290","DOI":"10.1137\/S0097539797324278","volume":"29","author":"R.D. Barve","year":"2000","unstructured":"Barve, R.D., Grove, E.F., Vitter, J.S.: Application-controlled paging for a shared cache. SIAM J. Comput.\u00a029, 1290\u20131303 (2000)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","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 computer. IBM Systems Journal\u00a05(2), 78\u2013101 (1966)","journal-title":"IBM Systems Journal"},{"key":"13_CR6","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York (1998)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF00121680","volume":"9","author":"K.I. Bouzina","year":"1996","unstructured":"Bouzina, K.I., Emmons, H.: Interval scheduling on identical machines. Journal of Global Optimization\u00a09, 379\u2013393 (1996)","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TC.2004.1255792","volume":"53","author":"M. Brehob","year":"2004","unstructured":"Brehob, M., Wagner, S., Torng, E., Enbody, R.J.: Optimal replacement is NP-hard for nonstandard caches. IEEE Trans. Computers\u00a053(1), 73\u201376 (2004)","journal-title":"IEEE Trans. Computers"},{"key":"13_CR9","unstructured":"Cao, P., Felten, E.W., Li, K.: Application-controlled file caching policies. In: Proceedings of USTC, vol.\u00a01, pp. 171\u2013182 (1994)"},{"key":"13_CR10","unstructured":"Cao, P., Irani, S.: Cost-aware WWW proxy caching algorithms. In: Proceedings of USITS, p. 18 (1997)"},{"issue":"2","key":"13_CR11","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."},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/1907450.1907547","volume":"41","author":"M. Chrobak","year":"2010","unstructured":"Chrobak, M.: SIGACT news online algorithms column 17. SIGACT News\u00a041(4), 114\u2013121 (2010)","journal-title":"SIGACT News"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s00453-011-9502-9","volume":"63","author":"M. Chrobak","year":"2012","unstructured":"Chrobak, M., Woeginger, G.J., Makino, K., Xu, H.: Caching is hard - even in the fault model. Algorithmica\u00a063(4), 781\u2013794 (2012)","journal-title":"Algorithmica"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-44676-1_8","volume-title":"Algorithms - ESA 2001","author":"J.. Csirik","year":"2001","unstructured":"Csirik, J., Imreh, C., Noga, J., Seiden, S.S., Woeginger, G.J.: Buying a constant competitive ratio for paging. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 98\u2013108. Springer, Heidelberg (2001)"},{"issue":"38-40","key":"13_CR15","doi-asserted-by":"publisher","first-page":"3694","DOI":"10.1016\/j.tcs.2009.04.023","volume":"410","author":"R. Dorrigiv","year":"2009","unstructured":"Dorrigiv, R., L\u00f3pez-Ortiz, A., Munro, J.I.: On the relative dominance of paging algorithms. Theor. Comput. Sci.\u00a0410(38-40), 3694\u20133701 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s00453-001-0073-z","volume":"32","author":"E. Feuerstein","year":"2002","unstructured":"Feuerstein, E., Strejilevich de Loma, A.: On-line multi-threaded paging. Algorithmica\u00a032(1), 36\u201360 (2002)","journal-title":"Algorithmica"},{"key":"13_CR17","unstructured":"Hassidim, A.: Cache replacement policies for multicore processors. In: Yao, A.C.C. (ed.) ICS, pp. 501\u2013509. Tsinghua University Press (2010)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Irani, S.: Page replacement with multi-size pages and applications to web caching. In: Proceedings of STOC, pp. 701\u2013710. ACM (1997)","DOI":"10.1145\/258533.258666"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/778553.778554","volume":"13","author":"S.F. Kaplan","year":"2003","unstructured":"Kaplan, S.F., Smaragdakis, Y., Wilson, P.R.: Flexible reference trace reduction for vm simulations. ACM Trans. Model. Comput. Simul.\u00a013(1), 1\u201338 (2003)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"13_CR20","unstructured":"L\u00f3pez-Ortiz, A., Salinger, A.: Minimizing cache usage in paging. Tech. Rep. CS-2012-15, University of Waterloo (2012), \n                    \n                      http:\/\/www.cs.uwaterloo.ca\/research\/tr\/2012\/CS-2012-15.pdf"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ortiz, A., Salinger, A.: Paging for multi-core shared caches. In: Goldwasser, S. (ed.) ITCS, pp. 113\u2013127. ACM (2012)","DOI":"10.1145\/2090236.2090246"},{"issue":"6","key":"13_CR22","first-page":"956","volume":"36","author":"H. Miyatake","year":"2001","unstructured":"Miyatake, H., Tanaka, M., Mori, Y.: A design for high-speed low-power CMOS fully parallel content-addressable memory macros. IEEE JSSC\u00a036(6), 956\u2013968 (2001)","journal-title":"IEEE JSSC"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Moruz, G., Negoescu, A.: Outperforming LRU via competitive analysis on parametrized inputs for paging. In: Proceedings of SODA, pp. 1669\u20131680 (2012)","DOI":"10.1137\/1.9781611973099.132"},{"issue":"3","key":"13_CR24","first-page":"712","volume":"41","author":"K. Pagiamtzis","year":"2006","unstructured":"Pagiamtzis, K., Sheikholeslami, A.: Content-addressable memory (CAM) circuits and architectures: A tutorial and survey. IEEE JSSC\u00a041(3), 712\u2013727 (2006)","journal-title":"IEEE JSSC"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Panagiotou, K., Souza, A.: On adequate performance measures for paging. In: Proceedings of STOC, pp. 487\u2013496. ACM (2006)","DOI":"10.1145\/1132516.1132587"},{"issue":"2","key":"13_CR26","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/PL00009192","volume":"20","author":"E. Torng","year":"1998","unstructured":"Torng, E.: A unified analysis of paging and caching. Algorithmica\u00a020, 194\u2013203 (1998)","journal-title":"Algorithmica"},{"key":"13_CR28","unstructured":"Wagner, S.: Restricted Cache Scheduling. Ph.D. thesis, Michigan State Univ. (2001)"},{"key":"13_CR29","unstructured":"Young, N.E.: On-line file caching. In: Proc. of SODA, pp. 82\u201386. SIAM (1998)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38016-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T15:20:41Z","timestamp":1557674441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38016-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642380150","9783642380167"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38016-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}