On Paging with Locality of Reference Susanne Albers Lene M. Favrholdty Oliver Gielz

First Page		Document Content
Date: 2013-11-25 11:04:07 Virtual memory Online algorithms Software Algorithm Mathematical logic Theoretical computer science Mathematics Paging Applied mathematics Page replacement algorithm		On Paging with Locality of Reference Susanne Albers Lene M. Favrholdty Oliver Gielz Add to Reading List Source URL: www14.in.tum.de Download Document from Source Website File Size: 341,36 KB Share Document on Facebook

	On the In uence of Lookahead in Competitive Paging Algorithms Susanne Albers Abstract We introduce a new model of lookahead for on-line paging algorithms and study several algorithms using this model. A paging algorithm DocID: 1rttb - View Document
	1 Partial Paging for Real-Time NoC Systems Adrian McMenamin and Neil C. Audsley Department of Computer Science, University of York, UK email: [acm538,neil.audsley]@york.ac.uk DocID: 1qeh5 - View Document
	CS264: Beyond Worst-Case Analysis Lecture #4: Parameterized Analysis of Online Paging∗ Tim Roughgarden† October 1, DocID: 1q4qJ - View Document
	On Paging with Locality of Reference Susanne Albers Lene M. Favrholdty Oliver Gielz DocID: 1pVgq - View Document
	Online Algorithms Susanne Albers University of Freiburg, Germany 1 Introduction This book chapter reviews fundamental concepts and results in the area of DocID: 1p7s3 - View Document