Page replacement algorithm

Results: 33



#Item
1On 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

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

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:07:34
21 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

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

Add to Reading List

Source URL: www.mpi-sws.org

Language: English - Date: 2016-07-14 16:23:27
3CS264: Beyond Worst-Case Analysis Lecture #4: Parameterized Analysis of Online Paging∗ Tim Roughgarden† October 1,

CS264: Beyond Worst-Case Analysis Lecture #4: Parameterized Analysis of Online Paging∗ Tim Roughgarden† October 1,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-02 12:34:37
4On Paging with Locality of Reference Susanne Albers Lene M. Favrholdty Oliver Gielz

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

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:04:07
5Online Algorithms Susanne Albers University of Freiburg, Germany 1 Introduction This book chapter reviews fundamental concepts and results in the area of

Online Algorithms Susanne Albers University of Freiburg, Germany 1 Introduction This book chapter reviews fundamental concepts and results in the area of

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:02:53
6CS369N: Beyond Worst-Case Analysis Lecture #8: Resource Augmentation∗ Tim Roughgarden† November 28,

CS369N: Beyond Worst-Case Analysis Lecture #8: Resource Augmentation∗ Tim Roughgarden† November 28,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2011-10-07 01:14:07
7ELSEVIER Information Processing

ELSEVIER Information Processing

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2004-07-14 08:53:51
8Caching Algorithms and Rational Models of Memory Avi Press () Michael Pacer () Thomas L. Griffiths (tom ) Department of Psychology, University of California,

Caching Algorithms and Rational Models of Memory Avi Press () Michael Pacer () Thomas L. Griffiths (tom ) Department of Psychology, University of California,

Add to Reading List

Source URL: cocosci.berkeley.edu

Language: English - Date: 2014-05-05 18:58:52
9CS140 Operating Systems and Systems Programming Midterm Exam February 9th, 2004 (Total time = 50 minutes, Total Points = 50) Name: (please print)______________________________ In recognition of and in the spirit of the S

CS140 Operating Systems and Systems Programming Midterm Exam February 9th, 2004 (Total time = 50 minutes, Total Points = 50) Name: (please print)______________________________ In recognition of and in the spirit of the S

Add to Reading List

Source URL: www.scs.stanford.edu

Language: English - Date: 2009-12-29 17:31:12
10CS140 Operating Systems and Systems Programming Midterm Exam February 12th, 2003 (Total time = 50 minutes, Total Points = 50) Name: (please print)______________________________ In recognition of and in the spirit of the

CS140 Operating Systems and Systems Programming Midterm Exam February 12th, 2003 (Total time = 50 minutes, Total Points = 50) Name: (please print)______________________________ In recognition of and in the spirit of the

Add to Reading List

Source URL: www.scs.stanford.edu

Language: English - Date: 2009-12-29 17:31:12