ACM Home Page
Please provide us with feedback. Feedback
Memory system behavior of Java programs: methodology and analysis
Full text PdfPdf (1.08 MB)
Source Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems table of contents
Santa Clara, California, United States
Pages: 264 - 274  
Year of Publication: 2000
ISBN:1-58113-194-1
Also published in ...
Authors
Jin-Soo Kim  Electronics and Telecommunications Research Institute (ETRI), Taejon 305-350, Korea
Yarsun Hsu  Dept. of Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan
Sponsor
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 58,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/339331.339422
What is a DOI?

ABSTRACT

This paper studies the memory system behavior of Java programs by analyzing memory reference traces of several SPECjvm98 applications running with a Just-In-Time (JIT) compiler. Trace information is collected by an exception-based tracing tool called JTRACE, without any instrumentation to the Java programs or the JIT compiler.First, we find that the overall cache miss ratio is increased due to garbage collection, which suffers from higher cache misses compared to the application. We also note that going beyond 2-way cache associativity improves the cache miss ratio marginally. Second, we observe that Java programs generate a substantial amount of short-lived objects. However, the size of frequently-referenced long-lived objects is more important to the cache performance, because it tends to determine the application's working set size. Finally, we note that the default heap configuration which starts from a small initial heap size is very inefficient since it invokes a garbage collector frequently. Although the direct costs of garbage collection decrease as we increase the available heap size, there exists an optimal heap size which minimizes the total execution time due to the interaction with the virtual memory performance.


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
 
2
S. Dasgupta and E. Serwn-Schreiber. Cache behavior of the SPEC95 benchmark suite. University of California at Berkeley, http ://http. es. berkeley, edu/-dasgupta, 1996.
3
 
4
J. Edler and M. D. Hill. Dinero IV trace-driven uniprocessor cache simulator, http://wuw.neci.nj .nec.com/ homepages/edler/d4/, 1998.
 
5
J. Gecsei, D. R. Slutz, and I. L. Traiger. Evaluation techniques for storage hierarchies. IBM Systems Journal, 9(~):7s-11~, 1970
6
 
7
 
8
 
9
IBM Corp. AIX Version ~.3 Kernel Extensions and Device Support Programming Concepts. 1998.
 
10
IBM Corp. PowerPC 60~e RISC Microprocessor User's Manual. 1998.
11
12
 
13
14
 
15
R. Radhakrishnan, J. Rubio, L. K. John, and N. Vijaykrishnan. Execution characteristics of just-in-time compilers. Technical Report TR-990717-0t, University of Texas at Austin, 1999.L
16
17
18
 
19
Standard Performance Evaluation Council. SPEC JVM98 benchmarks, htl;p://www.spec, org/osg/jvmg8/, 1998.
 
20
21
 
22
B. G. Zorn. The effect of garbage collection on cache performance. Technical Report CU-CS-528-91, University of Colorado at Boulder, May 1991.

CITED BY  8
 


Peer to Peer - Readers of this Article have also read: