Dynamic metrics for Java']Java

被引:44
作者
Dufour, B [1 ]
Driesen, K [1 ]
Hendren, L [1 ]
Verbrugge, C [1 ]
机构
[1] McGill Univ, Sch Comp Sci, Montreal, PQ H3A 2A7, Canada
关键词
experimentation; languages; measurement; performance; standardization; dynamic metrics; software metrics; program analysis; !text type='Java']Java[!/text; profiling; execution traces; optimization;
D O I
10.1145/949343.949320
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In order to perform meaningful experiments in optimizing compilation and run-time system design, researchers usually rely on a suite of benchmark programs of interest to the optimization technique under consideration. Programs are described as numeric, memory-intensive, concurrent, or object-oriented, based on a qualitative appraisal, in some cases with little justification. We believe it is beneficial to quantify the behaviour of programs with a concise and precisely defined set of metrics, in order to make these intuitive notions of program behaviour more concrete and subject to experimental validation. We therefore define and measure a set of unambiguous, dynamic, robust and architecture-independent metrics that can be used to categorize programs according to their dynamic behaviour in five areas: size, data structure, memory use, concurrency, and polymorphism. A framework computing some of these metrics for Java programs is presented along with specific results demonstrating how to use metric data to understand a program's behaviour, and both guide and evaluate compiler optimizations.
引用
收藏
页码:149 / 168
页数:20
相关论文
共 33 条
[1]  
AGESEN O, 1999, TR9976 SUN MICR
[2]  
AGGARWAL KK, 2003, ACM SIGSOFT SOFTWARE, V28, P1
[3]  
AIGNER G, 1996, LECT NOTES COMPUTER, V1098, P142
[4]  
BACON DF, 2001, P ACM SIGPLAN C PROG, P92
[5]  
BACON DF, 1998, P ACM SIGPLAN 98 C P, P258
[6]   Removing unnecessary synchronization in Java']Java [J].
Bogda, J ;
Hölzle, U .
ACM SIGPLAN NOTICES, 1999, 34 (10) :35-46
[7]   Data flow analysis for software prefetching linked data structures in Java']Java [J].
Cahoon, B ;
McKinley, KS .
2001 INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES, PROCEEDINGS, 2001, :280-291
[8]  
Chang PY, 1997, ACM COMP AR, P274, DOI 10.1145/384286.264209
[9]   Modular interprocedural pointer analysis using access paths: Design, implementation, and evaluation [J].
Cheng, BC ;
Hwu, WMW .
ACM SIGPLAN NOTICES, 2000, 35 (05) :57-69
[10]  
CHILIMBI T, 2001, P ACM SIGPLAN C PROG, P191