Competitive snoopy caching

By Anna R. Karlin, Mark S. Manasse, Larry Rudolph, D. Sleator. 1986

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Heng Zeng
2. Carla Schlatter Ellis
3. Alvin R. Lebeck
4. Xiaobo Fan
5. Anton Beloglazov
6. Canturk Isci
7. Radhika Mittal
8. Rajkumar Buyya

Citations in the corpus

• Dynamic Right-Sizing for Power-Proportional Data Centers (2011, unknown): “, to stop “renting” and to “buy”) is 2-competitive [38].”
• Power aware page allocation (2000, methodology): “A particularly valuable approach is based on the \ski rent-to-buy" problem formulation for competitive algorithms [22, 25].”