Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
We present architectures and algorithms for efficiently serving dynamic data at highly access Web sites together with the results of an analysis motivating our design and quantifying its performance benefits. This includes algorithms for keeping cached data consistent so that dynamic pages can be cached at the Web server and dynamic content can be served at the performance level of static content. We show that our system design is able to achieve cache hit ratios close to 100% for cached data which is almost never obsolete by more than a few seconds, if at all. Our architectures and algorithms provide more than an order of magnitude improvement in performance using an order of magnitude fewer servers over that obtained under conventional methods.
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Fan Zhang, Junwei Cao, et al.
IEEE TETC
Preeti Malakar, Thomas George, et al.
SC 2012
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research