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

First Page		Document Content
Date: 2013-11-25 11:07:34 Page replacement algorithm Virtual memory Canonical LR parser		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 Download Document from Source Website File Size: 245,20 KB Share Document on Facebook