Managing prefetch memory for data-intensive online servers

FAST 2005 - 4th USENIX Conference on File and Storage Technologies

Volumn , Issue , 2005, Pages 253-266

  Li, Chuanpeng ^a   Shen, Kai ^a  

^a University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER OPERATING SYSTEMS; FIRE FIGHTING EQUIPMENT;

APACHE WEB SERVER; DATA ACCESS PATTERNS; HEURISTIC POLICIES; HIGH CONCURRENCIES; MEMORY CONTENTIONS; MEMORY MANAGEMENT; MICRO-BENCHMARKS; REAL APPLICATIONS;

CACHE MEMORY;

EID: 85077324913     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. S. V. Anastasiadis, R. G. Wickremesinghe, and J. S. Chase. Circus: Opportunistic Block Reordering for Scalable Content Servers. In Proc. of the Third USENIX Conf. on File and Storage Technologies (FAST ’04), pages 201–212, San Fancisco, CA, March 2004.
2. M. Arlitt and T. Jin. Workload Characterization of the 1998 World Cup Web Site. Technical Report HPL-1999-35, HP Laboratories Palo Alto, 1999.
3. Ask Jeeves Search. http://www.ask.com.
4. L. A. Belady. A Study of Replacement Algorithms for Virtual Storage Computers. IBM Systems Journal, 5(2):78–101, 1966.
5. P. Cao, E. W. Felten, A. R. Karlin, and K. Li. A Study of Integrated Prefetching and Caching Strategies. In Proc. of the ACM SIGMETRICS, pages 188–197, Ottawa, Canada, June 1995.
6. P. Cao, E. W. Felten, and K. Li. Implementation and Performance of Application-Controlled File Caching. In Proc. of the First USENIX Symp. on Operating Systems Design and Implementation (OSDI’94), Monterey, CA, November 1994.
7. F. Chang and G. Gibson. Automatic I/O Hint Generation Through Speculative Execution. In Proc. of the Third USENIX Symp. on Operating Systems Design and Implementation (OSDI’99), New Orleans, LA, February 1999.
8. P. J. Denning. The Working Set Model for Program Behavior. Communications of the ACM, 11:323–333, May 1968.
9. K. Fraser and F. Chang. Operating System I/O Speculation: How Two Invocations Are Faster Than One. In Proc. of the USENIX Annual Technical Conference, San Antonio, TX, June 2003.
10. S. M. Hand. Self-paging in the Nemesis Operating System. In Proc. of the Third USENIX Symp. on Operating Systems Design and Implementation (OSDI’99), New Orleans, LA, February 1999.
11. S. Iyer and P. Druschel. Anticipatory Scheduling: A Disk Scheduling Framework to Overcome Deceptive Idleness in Synchronous I/O. In Proc. of the 18th ACM Symp. on Operating Systems Principles (SOSP’01), pages 117 – 130, Banff, Canada, October 2001.
12. S. Jiang and X. Zhang. LIRS: An Efficient Low Inter-reference Recency Set Replacement Policy to Improve Buffer Cache Performance. In Proc. of the ACM SIGMETRICS, pages 31–42, Marina Del Rey, CA, June 2002.
13. T. Johnson and D. Shasha. 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. In Proc. of the 20th VLDB Conference, pages 439–450, Santiago, Chile, September 1994.
14. S. F. Kaplan, L. A. McGeoch, and M. F. Cole. Adaptive Caching for Demand Prepaging. In Proc. of the Third Int’l Symp. on Memory Management, pages 114–126, Berlin, Germany, June 2002.
15. J. M. Kim, J. Choi, J. Kim, S. H. Noh, S. L. Min, Y. Cho, and C. S. Kim. A Low-Overhead High-Performance Unified Buffer Management Scheme that Exploits Sequential and Looping References. In Proc. of the 4th USENIX Symp. on Operating Systems Design and Implementation (OSDI’00), San Diego, CA, October 2000.
16. T. Kimbrel, A. Tomkins, R. H. Patterson, B. Bershad, P. Cao, E. W. Felten, G. A. Gibson, A. R. Karlin, and K. Li. A Trace-Driven Comparison of Algorithms for Parallel Prefetching and Caching. In Proc. of the Second USENIX Symp. on Operating Systems Design and Implementation (OSDI’96), Seattle, WA, October 1996.
17. C. Li, A. Papathanasiou, and K. Shen. Competitive Prefetching for Data-Intensive Online Servers. In Proc. of the First Workshop on Operating System and Architectural Support for the on demand IT InfraStructure, Boston, MA, October 2004.
18. K. Li and S. Jamin. A Measurement-Based Admission-Controlled Web Server. In Proc. of the IEEE INFOCOM, pages 651–659, Tel-Aviv, Israel, March 2000.
19. R. L. Mattson, J. Gecsei, D. R. Slutz, and I. L. Traiger. Evaluation Techniques for Storage Hierarchies. IBM Systems J., 9(2):78–117, 1970.
20. V. S. Pai, P. Druschel, and W. Zwaenepoel. Flash: An Efficient and Portable Web Server. In Proc. of the USENIX Annual Technical Conference, Monterey, CA, June 1999.
21. A. Papathanasiou and M. Scott. Aggressive Prefetching: An Idea Whose Time Has Come. In Proc. of the 10th Workshop on Hot Topics in Operating Systems, Santa Fe, NM, June 2005.
22. A. E. Papathanasiou and M. L. Scott. Energy Efficient Prefetching and Caching. In Proc. of the USENIX Annual Technical Conference, Boston, MA, June 2004.
23. R. H. Patterson, G. A. Gibson, E. Ginting, D. Stodolsky, and J. Zelenka. Informed Prefetching and Caching. In Proc. of the 15th ACM Symp. on Operating Systems Principles (SOSP’95), pages 79–95, Copper Mountain Resort, CO, December 1995.
24. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 2nd edition, 2003.
25. K. Shen, M. Zhong, and C. Li. I/O System Performance Debugging Using Model-driven Anomaly Characterization. In Proc. of the 4th USENIX Conf. on File and Storage Technologies (FAST’05), San Francisco, CA, December 2005.
26. E. Shriver, C. Small, and K. Smith. Why Does File System Prefetching Work ? In Proc. of the USENIX Annual Technical Conference, Monterey, CA, June 1999.
27. A. J. Smith. Sequentiality and Prefetching in Database Systems. ACM Transactions on Database Systems, 3(3):223–247, September 1978.
28. D. Thiébaut, H. S. Stone, and J. L. Wolf. Improving Disk Cache Hit-Ratios Through Cache Partitioning. IEEE Transactions on Computers, 41(6):665–676, June 1992.
29. A. Tomkins, R. H. Patterson, and G. A. Gibson. Informed Multi-Process Prefetching and Caching. In Proc. of the ACM SIGMETRICS, pages 100–114, Seattle, WA, June 1997.
30. T. Voigt and P. Gunningberg. Dealing with Memory-Intensive Web Requests. Technical Report 2001-010, Uppsala University, May 2001.
31. T. Voigt, R. Tewari, D. Freimuth, and A. Mehra. Kernel Mechanisms for Service Differentiation in Overloaded Web Servers. In Proc. of the USENIX Annual Technical Conference, Boston, MA, June 2001.
32. R. von Behren, J. Condit, F. Zhou, G. C. Necula, and E. Brewer. Capriccio: Scalable Threads for Internet Services. In Proc. of the 19th ACM Symp. on Operating Systems Principles (SOSP’03), pages 268–281, Bolton Landing, NY, October 2003.
33. M. Welsh and D. Culler. Adaptive Overload Control for Busy Internet Servers. In Proc. of the 4th USENIX Symp. on Internet Technologies and Systems, Seattle, WA, March 2003.
34. M. Welsh, D. Culler, and E. Brewer. SEDA: An Architecture for Well-Conditioned, Scalable Internet Services. In Proc. of the 18th ACM Symp. on Operating Systems Principles (SOSP’01), pages 230–243, Banff, Canada, October 2001.