We study the writeback-aware caching problem, a variant of classic paging where paging requests that modify data and requests that leave data intact are treated differently. We give an O(log^2 k) competitive randomized algorithm, answering an open question of Beckmann et al. [8] and Even et
We consider a variant of the online paging problem where the online algorithm may buy additional cac...
We consider a variant of the online paging problem where the online algorithm may buy additional cac...
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimi...
We study the writeback-aware caching problem, a variant of classic paging where paging requests that...
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We de...
An efficient randomized online algorithm for the paging problem for cache size 2 is given, which is ...
Weighted caching is a generalization of paging in which the cost to evict an item depends on the ite...
A generalized paging problem is considered. Each request is expressed as a set of $u$ pages. In orde...
We tackle the problem of online paging on two level memories with arbitrary associativity (including...
We construct an online algorithm for paging that achieves an O(r+log k) competitive ratio when compa...
AbstractThe paging problem is defined as follows: we are given a two-level memory system, in which o...
Caching (paging) is a well-studied problem in online algorithms, usually studied under the assumptio...
Reconsider the competitiveness ofon-line strategies using k servers versus the optimal off-line stra...
We consider a variant of the online paging problem where the online algorithm may buy additional cac...
We consider a variant of the online paging problem where the online algorithm may buy additional cac...
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimi...
We study the writeback-aware caching problem, a variant of classic paging where paging requests that...
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We de...
An efficient randomized online algorithm for the paging problem for cache size 2 is given, which is ...
Weighted caching is a generalization of paging in which the cost to evict an item depends on the ite...
A generalized paging problem is considered. Each request is expressed as a set of $u$ pages. In orde...
We tackle the problem of online paging on two level memories with arbitrary associativity (including...
We construct an online algorithm for paging that achieves an O(r+log k) competitive ratio when compa...
AbstractThe paging problem is defined as follows: we are given a two-level memory system, in which o...
Caching (paging) is a well-studied problem in online algorithms, usually studied under the assumptio...
Reconsider the competitiveness ofon-line strategies using k servers versus the optimal off-line stra...
We consider a variant of the online paging problem where the online algorithm may buy additional cac...
We consider a variant of the online paging problem where the online algorithm may buy additional cac...
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimi...
DOI
Add to ORKG