A streaming algorithms approach to approximating hit rate curves
In this work, we study systems with two levels of memory: a fixed-size cache, and a backing store, each of which contain blocks. In order to serve an IO request, the block must be in the cache. If the block is already in the cache when it is requested, the request is a cache hit. Otherwise it is a c...
Main Author: | Drudi, Zachary |
---|---|
Language: | English |
Published: |
University of British Columbia
2014
|
Online Access: | http://hdl.handle.net/2429/50486 |
Similar Items
-
Live streaming channels recommendation using HITS algorithm
by: Liu, Yu-Wen, et al.
Published: (2014) -
Faster streaming algorithms for low-rank matrix approximations
by: Galvin, Timothy Matthew
Published: (2014) -
Geometric Approximation Algorithms in the Online and Data Stream Models
by: Zarrabi-Zadeh, Hamid
Published: (2008) -
Geometric Approximation Algorithms in the Online and Data Stream Models
by: Zarrabi-Zadeh, Hamid
Published: (2008) -
An Approximate L p Difference Algorithm for Massive Data Streams
by: Jessica H. Fong, et al.
Published: (2001-12-01)