ACM Home Page
Please provide us with feedback. Feedback
Dynamic tracking of page miss ratio curve for memory management
Full text PdfPdf (281 KB)
Source Architectural Support for Programming Languages and Operating Systems archive
Proceedings of the 11th international conference on Architectural support for programming languages and operating systems table of contents
Boston, MA, USA
SESSION: Memory system analysis and optimization table of contents
Pages: 177 - 188  
Year of Publication: 2004
ISBN:1-58113-804-0
Also published in ...
Authors
Pin Zhou  University of Illinois at Urbana-Champaign
Vivek Pandey  University of Illinois at Urbana-Champaign
Jagadeesan Sundaresan  University of Illinois at Urbana-Champaign
Anand Raghuraman  University of Illinois at Urbana-Champaign
Yuanyuan Zhou  University of Illinois at Urbana-Champaign
Sanjeev Kumar  Intel Labs, Santa Clara, CA
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGOPS: ACM Special Interest Group on Operating Systems
SIGARCH: ACM Special Interest Group on Computer Architecture
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 41,   Downloads (12 Months): 141,   Citation Count: 21
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1024393.1024415
What is a DOI?

ABSTRACT

Memory can be efficiently utilized if the dynamic memory demands of applications can be determined and analyzed at run-time. The page miss ratio curve(MRC), i.e. page miss rate vs. memory size curve, is a good performance-directed metric to serve this purpose. However, dynamically tracking MRC at run time is challenging in systems with virtual memory because not every memory reference passes through the operating system (OS).This paper proposes two methods to dynamically track MRC of applications at run time. The first method is using a hardware MRC monitor that can track MRC at fine time granularity. Our simulation results show that this monitor has negligible performance and energy overheads. The second method is an OS-only implementation that can track MRC at coarse time granularity. Our implementation results on Linux show that it adds only 7--10% overhead.We have also used the dynamic MRC to guide both memory allocation for multiprogramming systems and memory energy management. Our real system experiments on Linux with applications including Apache Web Server show that the MRC-directed memory allocation can speed up the applications' execution/response time by up to a factor of 5.86 and reduce the number of page faults by up to 63.1%. Our execution-driven simulation results with SPEC2000 benchmarks show that the MRC-directed memory energy management can improve the Energy * Delay metric by 27--58% over previously proposed static and dynamic schemes.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Apache web server. http://httpd.apache.org/test/flood.
 
2
Flood: A profile driven http load tester. http://httpd.apache.org/test/flood.
 
3
 
4
L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web caching and zipf-like distributions: Evidence and implications. In INFOCOM (1), pages 126--134, 1999.
5
 
6
A. D. Brown and T. C. Mowry. Taming the memory hogs: Using compiler-inserted releases to manage physical memory intelligently. In OSDI, Oct 2000.
 
7
D. Burger, T. M. Austin, and S. Bennett. Evaluating future microprocessors: The simplescalar tool set. Technical Report CS-TR-1996-1308, Univ. of Wisconsin-Madison, 1996.
8
 
9
10
 
11
W. Chu and H. Opderbeck. The page fault frequency replacement algorithm. In AFIPS Conf. Proc., 1972.
 
12
13
14
 
15
16
 
17
P. Denning. Thrashing: Its causes and prevention. In AFIPS Fall Joint Computer Conference, 1968.
 
18
P. J. Denning. Memory allocation in multiprogrammed computers. In Project MAC Computation Structures Group Memo, Mar 1966.
19
 
20
 
21
M. Dillon. Design elements of the freebsd vm system. Daemon News, Jan 2001.
22
23
 
24
R. L. M. et al. Evaluation techniques for storage hierarchies. IBM Systems Journal, 9(2):78--117, 1970.
25
 
26
D. Ferrari and Y.-Y. Yih. VSWS: The variable-interval sampled working set policy. IEEE Trans. on Software Engineering, SE-9, 1993.
 
27
R. K. Gupta and M. A. Franklin. Working set and page fault frequency replacement algorithms: A performance comparison. IEEE Transactions on Computers, C-27, 1978.
 
28
 
29
 
30
H. Huang, P.Padmanabhan, and K. Shin. Design and implementation of power-aware virtual memory. In USENIX, 2003.
 
31
32
33
34
 
35
 
36
J. Kim, J. Choi, J. Kim, S. Noh, S. Min, Y. Cho, and C. Kim. A low-overhead high-performance unified buffer management scheme that exploits sequential and looping references. OSDI, 2000.
37
38
 
39
 
40
K. Li. Ivy: A shared virtual memory system for parallel computing. In Proceedings of the 1988 International Conference on Parallel Processing, volume II Software, pages 94--101, Aug. 1988.
41
42
 
43
B. Moore. Taking the data center power and cooling challenge. Energy User News, August 27th, 2002.
44
 
45
 
46
A. Raghuraman. Miss-ratio curve directed memory management for high performance and low energy. UIUC, Master Thesis, 2003.
 
47
 
48
 
49
Rambus. Rdram. http://www.rambus.com, 1999.
50
51
 
52
B. J. Smith. A pipelined, shared resource MIMD computer. In Proceedings of International Conference on Parallel Proc essing, pages 6--8, 1978.
 
53
 
54
 
55
56
57
 
58
P. R. Wilson, S. F. Kaplan, and Y. Smaragdakis. The case for compressed caching in virtual memory systems. In USENIX, 1999.
 
59
S. Woo, M. Ohara, E. Torrie, J.P.Singh, and A. Gupta. Methodological considerations and characterization of the splash-2 parallel application suite. In ISCA-23, May 1996.

CITED BY  21

Collaborative Colleagues:
Pin Zhou: colleagues
Vivek Pandey: colleagues
Jagadeesan Sundaresan: colleagues
Anand Raghuraman: colleagues
Yuanyuan Zhou: colleagues
Sanjeev Kumar: colleagues