Sciweavers

30 search results - page 1 / 6
» A New Competitive Analysis of Randomized Caching
Sort
View
ISAAC
2000
Springer
113views Algorithms» more  ISAAC 2000»
13 years 10 months ago
A New Competitive Analysis of Randomized Caching
Ching Law, Charles E. Leiserson
SIAMCOMP
2012
11 years 8 months 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
EUROPAR
2005
Springer
13 years 12 months ago
New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
CCS
2008
ACM
13 years 8 months ago
Deconstructing new cache designs for thwarting software cache-based side channel attacks
Software cache-based side channel attacks present a serious threat to computer systems. Previously proposed countermeasures were either too costly for practical use or only effect...
Jingfei Kong, Onur Aciiçmez, Jean-Pierre Se...
SPAA
2004
ACM
13 years 12 months ago
Online hierarchical cooperative caching
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun V...