{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:46:50Z","timestamp":1648543610196},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T00:00:00Z","timestamp":1303257600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Sci Res Dev"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s00450-011-0152-6","type":"journal-article","created":{"date-parts":[[2011,4,19]],"date-time":"2011-04-19T08:12:30Z","timestamp":1303200750000},"page":"197-205","source":"Crossref","is-referenced-by-count":1,"title":["Adversarial models in paging"],"prefix":"10.1007","volume":"27","author":[{"given":"Alexander","family":"Souza","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,20]]},"reference":[{"key":"152_CR1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0304-3975(98)00116-9","volume":"234","author":"D Achlioptas","year":"2000","unstructured":"Achlioptas D, Chrobak M, Noga J (2000) Competitive analysis for randomized paging algorithms. Theor Comput Sci 234:203\u2013218","journal-title":"Theor Comput Sci"},{"key":"152_CR2","first-page":"258","volume-title":"Proceedings of the 34th annual ACM symposium on theory of computing (STOC\u00a0\u201902)","author":"S Albers","year":"2002","unstructured":"Albers S, Favrholdt LM, Giel O (2002) On paging with locality of reference. In: Proceedings of the 34th annual ACM symposium on theory of computing (STOC\u00a0\u201902), pp\u00a0258\u2013267"},{"key":"152_CR3","first-page":"98","volume-title":"Proceedings of the 12th annual European symposium on algorithms (ESA\u00a0\u201904)","author":"L Becchetti","year":"2004","unstructured":"Becchetti L (2004) Modeling locality: a probabilistic analysis of LRU and FWF. In: Proceedings of the 12th annual European symposium on algorithms (ESA\u00a0\u201904), pp\u00a098\u2013109"},{"key":"152_CR4","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"LA Belady","year":"1966","unstructured":"Belady LA (1966) A study of replacement algorithms for virtual storage computers. IBM Syst J 5:78\u2013101","journal-title":"IBM Syst J"},{"key":"152_CR5","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"issue":"2","key":"152_CR6","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1006\/jcss.1995.1021","volume":"50","author":"A Borodin","year":"1995","unstructured":"Borodin A, Irani S, Raghavan P, Schieber B (1995) Competitive paging with locality of reference. J Comput Syst Sci 50(2):244\u2013258","journal-title":"J Comput Syst Sci"},{"key":"152_CR7","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/PL00009255","volume":"23","author":"M Chrobak","year":"1999","unstructured":"Chrobak M, Noga J (1999) LRU is better than FIFO. Algorithmica 23:180\u2013185","journal-title":"Algorithmica"},{"key":"152_CR8","volume-title":"Operating systems theory","author":"EG Coffman Jr","year":"1973","unstructured":"Coffman EG Jr, Denning PJ (1973) Operating systems theory. Prentice-Hall, New York"},{"issue":"5","key":"152_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/363095.363141","volume":"11","author":"PJ Denning","year":"1968","unstructured":"Denning PJ (1968) The working set model for program behavior. Commun ACM 11(5):323\u2013333","journal-title":"Commun ACM"},{"key":"152_CR10","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TSE.1980.230464","volume":"6","author":"PJ Denning","year":"1980","unstructured":"Denning PJ (1980) Working sets past and present. IEEE Trans Softw Eng 6:64\u201384","journal-title":"IEEE Trans Softw Eng"},{"key":"152_CR11","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/SFCS.1997.646121","volume-title":"Proceedings of the 38th annual symposium on foundations of computer science (FOCS\u00a0\u201997)","author":"A Fiat","year":"1997","unstructured":"Fiat A, Mendel M (1997) Truly online paging with locality of reference. In: Proceedings of the 38th annual symposium on foundations of computer science (FOCS\u00a0\u201997), pp\u00a0326\u2013335"},{"key":"152_CR12","first-page":"63","volume-title":"Proceedings of the 8th ACM-SIAM symposium on discrete algorithms (SODA\u00a0\u201997)","author":"A Fiat","year":"1997","unstructured":"Fiat A, Rosen Z (1997) Experimental studies of access graph based heuristics: beating the LRU standard? In: Proceedings of the 8th ACM-SIAM symposium on discrete algorithms (SODA\u00a0\u201997), pp\u00a063\u201372"},{"issue":"4","key":"152_CR13","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, Karp RM, Luby M, McGeoch LA, Sleator DD, Young NE (1991) Competitive paging algorithms. J Algorithms 12(4):685\u2013699","journal-title":"J Algorithms"},{"key":"152_CR14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321796.321800","volume":"21","author":"PA Franaszek","year":"1974","unstructured":"Franaszek PA, Wagner TJ (1974) Some distribution-free aspects of paging performance. J ACM 21:31\u201339","journal-title":"J ACM"},{"issue":"3","key":"152_CR15","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/S0097539792236353","volume":"25","author":"S Irani","year":"1996","unstructured":"Irani S, Karlin AR, Phillips S (1996) Strongly competitive algorithms for paging with locality of reference. SIAM J Comput 25(3):477\u2013497","journal-title":"SIAM J Comput"},{"key":"152_CR16","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/SFCS.1992.267771","volume-title":"Proceedings of the 33rd annual symposium on foundations of computer science (FOCS\u00a0\u201992)","author":"AR Karlin","year":"1992","unstructured":"Karlin AR, Phillips SJ, Raghavan P (1992) Markov paging. In: Proceedings of the 33rd annual symposium on foundations of computer science (FOCS\u00a0\u201992), pp\u00a0208\u2013217"},{"issue":"1","key":"152_CR17","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/S0097539796299540","volume":"30","author":"E Koutsoupias","year":"2000","unstructured":"Koutsoupias E, Papadimitriou CH (2000) Beyond competitive analysis. SIAM J Comput 30(1):300\u2013317","journal-title":"SIAM J Comput"},{"issue":"1\u20136","key":"152_CR18","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"LA McGeoch","year":"1991","unstructured":"McGeoch LA, Sleator DD (1991) A strongly competitive randomized algorithm. Algorithmica 6(1\u20136):816\u2013825","journal-title":"Algorithmica"},{"key":"152_CR19","volume-title":"Proceedings of the 38th annual ACM symposium on theory of computing (STOC\u00a0\u201906)","author":"K Panagiotou","year":"2006","unstructured":"Panagiotou K, Souza A (2006) On adequate performance measures for paging. In: Proceedings of the 38th annual ACM symposium on theory of computing (STOC\u00a0\u201906)"},{"key":"152_CR20","first-page":"186","volume-title":"15th IEEE international symposium on computer architecture","author":"RL Sites","year":"1988","unstructured":"Sites RL, Agarwal A (1988) Multiprocessor cache analysis using ATUM. In: 15th IEEE international symposium on computer architecture, pp\u00a0186\u2013195"},{"issue":"2","key":"152_CR21","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator DD, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202\u2013208","journal-title":"Commun ACM"},{"key":"152_CR22","unstructured":"SPEC\u2014Standard Performance Evaluation Corporation. www.spec.org"},{"key":"152_CR23","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/PL00009192","volume":"20","author":"E Torng","year":"1998","unstructured":"Torng E (1998) A unified analysis of paging and caching. Algorithmica 20:175\u2013200","journal-title":"Algorithmica"},{"key":"152_CR24","volume-title":"Theory of games and economic bahaviour","author":"J Neumann von","year":"1944","unstructured":"von Neumann J, Morgenstern O (1944) Theory of games and economic bahaviour. Princeton University Press, Princeton"},{"key":"152_CR25","first-page":"241","volume-title":"Proceedings of the 2nd ACM-SIAM symposium on discrete algorithms (SODA\u00a0\u201991)","author":"N Young","year":"1991","unstructured":"Young N (1991) On-line caching as cache size varies. In: Proceedings of the 2nd ACM-SIAM symposium on discrete algorithms (SODA\u00a0\u201991), pp\u00a0241\u2013250"},{"issue":"1","key":"152_CR26","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1006\/jagm.2000.1099","volume":"37","author":"NE Young","year":"2000","unstructured":"Young NE (2000) On-line paging against adversarially biased random inputs. J Algorithms 37(1):218\u2013235","journal-title":"J Algorithms"}],"container-title":["Computer Science - Research and Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-011-0152-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00450-011-0152-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-011-0152-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:32:47Z","timestamp":1559122367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00450-011-0152-6"}},"subtitle":["Bridging the gap between theory and practice"],"short-title":[],"issued":{"date-parts":[[2011,4,20]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["152"],"URL":"https:\/\/doi.org\/10.1007\/s00450-011-0152-6","relation":{},"ISSN":["1865-2034","1865-2042"],"issn-type":[{"value":"1865-2034","type":"print"},{"value":"1865-2042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,20]]}}}