30 search results - page 2 / 6 » A New Competitive Analysis of Randomized Caching |
ECRTS
2006
IEEE
13 years 10 months ago
2006
IEEE
Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems...
SODA
1998
ACM
13 years 6 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
MASCOTS
2010
13 years 6 months ago
2010
: New Algorithms for File System Cooperative Caching Eric Anderson, Christopher Hoover, Xiaozhou Li HP Laboratories HPL-2010-69 cooperative caching We present two new cooperative ...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...