Amortized efficiency of list update and paging rules
Communications of the ACM
Journal of Algorithms
Page replacement with multi-size pages and applications to Web caching
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Competitive analysis of randomized paging algorithms
Theoretical Computer Science
Connection caching under various models of communication
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
More on weighted servers or FIFO is better than LRU
Theoretical Computer Science
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
A study of integrated document and connection caching
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Resource augmented semi-online bounded space bin packing
Discrete Applied Mathematics
| Hi-index | 5.23 |
We continue the study of the integrated document and connection caching problem. We focus on the case where the connection cache has a size of one and show that this problem is not equivalent to standard paging, even if there are only two locations for the pages, by giving the first lower bound that is strictly higher than k for this problem. We then give the first upper bound below the trivial value of 2k for this problem. Our upper bound is k+4@? where @? is the number of locations where the requested pages in a phase come from. This algorithm groups pages by location. In each phase, it evicts all pages from one location before moving on to the next location. In contrast, we show that the lru algorithm is not better than 2k-competitive. We also examine the resource augmented model and show that the plain fifo algorithm is optimal for the case h=2 and all k=2, where h is the size of the offline document cache. We show that also in this case fifo is better than lru, although this is not true for standard paging.