Abstract
Java's object oriented nature along with its distributed nature make it a good choice for network computing. The use of virtual methods associated with Java's object oriented behavior requires accurate target prediction for indirect branches. This is critical to the performance of Java applications executed on deeply pipelined, wide issue processors. In this paper, we investigate the use of a path history based predictor to accurately determine the target of these virtual methods. The effect of varying the various parameters of the predictor on the misprediction rates is studied using various Java benchmarks. Results from this study show that the execution of Java code will benefit from more sophisticated branch-predictors.
Original language | English (US) |
---|---|
Pages | 217-228 |
Number of pages | 12 |
State | Published - 1999 |
Event | 5th USENIX Conference on Object-Oriented Technologies and Systems, COOTS 1999 - San Diego, United States Duration: May 3 1999 → May 7 1999 |
Conference
Conference | 5th USENIX Conference on Object-Oriented Technologies and Systems, COOTS 1999 |
---|---|
Country/Territory | United States |
City | San Diego |
Period | 5/3/99 → 5/7/99 |
All Science Journal Classification (ASJC) codes
- Computational Theory and Mathematics
- Computer Science Applications
- Information Systems
- Hardware and Architecture
- Software