The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Adaptive optimization in the Jalapeño JVM
Abstract
Future high-performance virtual machines will improve performance through sophisticated online feedback-directed optimizations. this paper presents the architecture of the Jalapeño Adaptive Optimization System, a system to support leading-edge virtual machine technology and enable ongoing research on online feedback-directed optimizations. We describe the extensible system architecture, based on a federation of threads with asynchronous communication. We present an implementation of the general architecture that supports adaptive multi-level optimization based purely on statistical sampling. We empirically demonstrate that this profiling technique has low overhead and can improve startup and steady-state performance, even without the presence of online feedback-directed optimizations. The paper also describes and evaluates an online feedback-directed inlining optimization based on statistical edge sampling. The system is written completely in Java, applying the described techniques not only to application code and standard libraries, but also to the virtual machine itself.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Java Language Specification
Gosling, J., Joy, B., & Steele, G. L. (1996) · Cited by 3,924
Efficiently computing static single assignment form and the control dependence graph
Cytron, R., Ferrante, J., Rosen, B. K., Wegman, M. N., & Zadeck, F. K. (1991) · ACM Transactions on Programming Languages and Systems · doi:10.1145/115372.115320 · Cited by 2,267
Linear scan register allocation
Poletto, M., & Sarkar, V. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/330249.330250 · Cited by 357
Ball, T., & Larus, J. R. (1993) · Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation · doi:10.1145/155090.155119 · Cited by 289
The Jalapeño dynamic optimizing compiler for Java
Burke, M., Choi, J.-D., Fink, S. J., Grove, D., Hind, M., Sarkar, V., Serrano, M. J., Sreedhar, V. C., Srinivasan, H., & Whaley, J. (1999) · doi:10.1145/304065.304113 · Cited by 271
Self-citationAlpern, B., Attanasio, C. R., Cocchi, A., Lieber, D., Smith, S., Ngo, T., Barton, J. J., Hummel, S. F., Sheperd, J. C., & Mergen, M. F. (1999) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/320384.320418 · Cited by 267
ABCD: eliminating array bounds checks on demand
Bodík, R., Gupta, R., & Sarkar, V. (2000) · Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation · doi:10.1145/349299.349342 · Cited by 234
Pickerell, A. G., & Dornin, M. (1968) · University of California Press eBooks · doi:10.1525/9780520339668-002 · Cited by 223
Profile‐guided automatic inline expansion for C programs
Chang, P. P., Mahlke, S. A., Chen, W. Y., & Hwu, W. W. (1992) · Software: Practice and Experience · doi:10.1002/spe.4380220502 · Cited by 161
tcc: a system for fast, flexible, and high-level dynamic code generation
Poletto, M., Engler, D., & Kaashoek, M. F. (1997) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/258915.258926 · Cited by 95
Cited by
Statistically rigorous java performance evaluation
Georges, A., Buytaert, D., & Eeckhout, L. (2007) · Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems, languages and applications · doi:10.1145/1297027.1297033 · Cited by 537
Qilin: exploiting parallelism on heterogeneous multiprocessors with adaptive mapping
Luk, C.-K., Hong, S., & Kim, H. (2009) · Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/1669112.1669121 · Cited by 506
Welc, A., Jagannathan, S., & Hosking, A. (2005) · Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/1094811.1094845 · Cited by 181
Grounded Copilot: How Programmers Interact with Code-Generating Models
Barke, S., James, M. B., & Polikarpova, N. (2022) · arXiv · doi:10.48550/arxiv.2206.15000 · Cited by 23
“For example, P16 wanted to set up property-based testing [Claessen and Hughes 2000] to run automatically on Copilot suggestions.”
Background
Metadata
- Authors
- Arnold, M., Fink, S., Grove, D., Hind, M., & Sweeney, P. F.
- Venue
- Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
- Publisher
- ACM
- Published
- 2000-10
- Pages
- 47-65
- OpenAlex
- W4246430693
- Cited by
- 257
- References
- 12
- FWCI
- 16.01
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Adaptive optimization in the Jalapeño JVM. https://app.cochat.ai/papers/10.1145/353171.353175
- The paper
- Arnold, M., Fink, S., Grove, D., Hind, M., & Sweeney, P. F. (2000). Adaptive optimization in the Jalapeño JVM. Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications. https://doi.org/10.1145/353171.353175
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.