Sciweavers

147 search results - page 10 / 30
» Online Companion Caching
Sort
View
EMSOFT
2009
Springer
15 years 4 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
SODA
2008
ACM
80views Algorithms» more  SODA 2008»
14 years 11 months ago
Provably good multicore cache performance for divide-and-conquer algorithms
This paper presents a multicore-cache model that reflects the reality that multicore processors have both per-processor private (L1) caches and a large shared (L2) cache on chip. ...
Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B....
FOCS
2007
IEEE
15 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
IPPS
2005
IEEE
15 years 3 months ago
Predicting Cache Space Contention in Utility Computing Servers
The need to provide performance guarantee in high performance servers has long been neglected. Providing performance guarantee in current and future servers is difficult because ï...
Yan Solihin, Fei Guo, Seongbeom Kim
ESA
2001
Springer
75views Algorithms» more  ESA 2001»
15 years 2 months ago
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
Alexander Gaysinsky, Alon Itai, Hadas Shachnai