Sciweavers

Share
79 search results - page 1 / 16
» Randomized Competitive Algorithms for Generalized Caching
Sort
View
SIAMCOMP
2012
8 years 27 days ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
ISAAC
2000
Springer
113views Algorithms» more  ISAAC 2000»
10 years 2 months ago
A New Competitive Analysis of Randomized Caching
Ching Law, Charles E. Leiserson
FOCS
2007
IEEE
10 years 4 months ago
A Primal-Dual Randomized Algorithm for Weighted Paging
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
CORR
2004
Springer
118views Education» more  CORR 2004»
9 years 10 months ago
Online Companion Caching
This paper is concerned with online caching algorithms for the (n, k)-companion cache, defined by Brehob et. al. [3]. In this model the cache is composed of two components: a k-way...
Manor Mendel, Steven S. Seiden
SPAA
2004
ACM
10 years 3 months ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
books