Transparent contribution of memory

USENIX 2006 Annual Technical Conference

Volumn , Issue , 2006, Pages 109-114

  Cipar, James ^a   Corner, Mark D ^a   Berger, Emery D ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SIGNAL PROCESSING;

COMMERCIAL PROJECTS; DESIGN AND IMPLEMENTATIONS; DISTRIBUTED COMPUTATIONS; LARGE-SCALE DISTRIBUTED STORAGE; MEMORY MANAGER; MEMORY USAGE; PEER TO PEER; USER ACTIVITY;

PEER TO PEER NETWORKS;

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

References (13)

1. G. Almasi, C. Cascaval, and D. A. Padua. Calculating stack distances efficiently. In The International Symposium on Memory Management (ISMM 2002), Berlin, Germany, June 2002.
2. J. Cipar, M. D. Corner, and E. D. Berger. Transparent contribution of storage and memory. Technical Report 06-05, University of Massachusetts-Amherst, Amerst, MA, January 2006.
3. Landon P. Cox, Christopher D. Murray, and Brian D. Noble. Pastiche: making backup cheap and easy. SIGOPS Oper. Syst. Rev., 36(SI):285–298, 2002.
4. Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP’01), Chateau Lake Louise, Banff, Canada, October 2001.
5. P. Druschel G. Banga and J. C. Mogul. Resource containers: A new facility for resource management in server systems. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, February 1999.
6. P. Goyal, D. Jadav, D. Modha, and R. Tewari. Cachecow: Qos for storage system caches. In International Workshop on Quality of Service (IWQoS), Monterey, CA, June 2003.
7. Theodore Johnson and Dennis Shasha. 2Q: a low overhead high performance buffer management replacement algorithm. In Proceedings of the Twentieth International Conference on Very Large Databases, pages 439–450, Santiago, Chile, 1994.
8. A. Rowstron and P. Druschel. Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 18th SOSP (SOSP’01), Chateau Lake Louise, Banff, Canada, October 2001.
9. Y. Smaragdakis, S. F. Kaplan, and P. R. Wilson. The EELRU adaptive replacement algorithm. Performance Evaluation, 53(2), July 2003.
10. C. A. Waldspurger and W. E. Weihl. Lottery scheduling: Flexible proportional-share resource management. In Proceedings of the 1st USENIX Symposium on Operating Systems Design and Implementation (OSDI), Monterey, CA, November 1994.
11. P. R. Wilson, S. F. Kaplan, and Y. Smaragdakis. The case for compressed caching in virtual memory systems. In Proceedings of The 1999 USENIX Annual Technical Conference, pages 101–116, Monterey, CA, June 1999.
12. T. Yang, M. Hertz, E. D. Berger, S. F. Kaplan, and J. E. B. Moss. Automatic heap sizing: Taking real memory into account. In Proceedings of the Third International Symposium on Memory Management (ISMM), Vancouver, October 2004.
13. P. Zhou, V. Pandey, J. Sundaresan, A. Raghuraman, Y. Zhou, and S. Kumar. Dynamically tracking miss-ratio-curve for memory management. In The Proceedings of the Eleventh International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS’04), October 2004.