Exploring processor design options for Java']Java-based middleware

被引:0
作者
Karlsson, M [1 ]
Hagersten, E [1 ]
Moore, KE [1 ]
Wood, DA [1 ]
机构
[1] Uppsala Univ, Dept Informat Technol, SE-75105 Uppsala, Sweden
来源
2005 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSSING, PROCEEDINGS | 2005年
关键词
!text type='Java']Java[!/text; Middleware; workloads; ILP; CMP; characterization;
D O I
10.1109/ICPP.2005.38
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Java-based middleware is a rapidly growing workload for high-end server processors, particularly Chip Multiprocessors (CMP). To help architects design future microprocessors to run this important new workload, we provide a detailed characterization of two popular Java server benchmarks, ECperf and SPECjbb2000. We first estimate the amount of instruction-level parallelism in these workloads by simulating a very wide issue processor with perfect caches and perfect branch predictors. We then identify performance bottlenecks for these workloads on a more realistic processor by selectively idealizing individual processor structures. Finally, we combine our findings on available ILP in Java middleware with results from previous papers that characterize the availibility of TLP to investigate the optimal balance between ILP and TLP in CMPs. We find that, like other commercial workloads, Java middleware has only a small amount of instruction-level parallelism, even when run on very aggressive processors. When run on processors resembling currently available processors, the performance of Java middleware is limited by frequent traps, address translation and stalls in the memory system. We find that SPECjbb2000 differs from ECperf in two meaningful ways: (1) the performance of ECperf is affected much more by cache and TLB misses during instruction fetch and (2) SPECjbb2000 has more memory-level parallelism.
引用
收藏
页码:59 / 68
页数:10
相关论文
共 28 条
[1]  
[Anonymous], P 27 ANN INT S COMP
[2]  
Barford P., 1998, Performance Evaluation Review, V26, P151, DOI 10.1145/277858.277897
[3]   Memory system characterization of commercial workloads [J].
Barroso, LA ;
Gharachorloo, K ;
Bugnion, E .
25TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, PROCEEDINGS, 1998, :3-14
[4]   An architectural evaluation of Java']Java TPC-W [J].
Cain, HW ;
Rajwar, R ;
Marden, M ;
Lipasti, MH .
HPCA: SEVENTH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTING ARCHITECTURE, PROCEEDINGS, 2001, :229-240
[5]  
CHALAINANONT N, 2004, 7 WORKSH COMP ARCH E
[6]   Memory dependence prediction using store sets [J].
Chrysos, GZ ;
Emer, JS .
25TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, PROCEEDINGS, 1998, :142-153
[7]   Accurate indirect branch prediction [J].
Driesen, K ;
Holzle, U .
25TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, PROCEEDINGS, 1998, :167-178
[8]   The YAGS branch prediction scheme [J].
Eden, AN ;
Mudge, T .
31ST ANNUAL ACM/IEEE INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE, PROCEEDINGS, 1998, :69-77
[9]  
EKMAN M, 2003, P INT C PAR PROC ICP
[10]   The optimum pipeline depth for a microprocessor [J].
Hartstein, A ;
Puzak, TR .
29TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, PROCEEDINGS, 2002, :7-13