Java server benchmarks

Baylor, Sandra Johnson; Devarakonda, Murthy V.; Fink, Stephen J.; Gluzberg, E.; Kalantar, Michael; Muttineni, P.; Barsness, E.; Arora, Ritu; Dimpsey, R. T.; Munroe, S. J.

doi:10.1147/sj.391.0057

Cited by 28 publications

(13 citation statements)

References 5 publications

(1 reference statement)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our benchmark suite consists of the SPECjvm98 [23] benchmarks with input size 10, the Jalapefio optimizing compiler [13] run on a small subset of itself, the Volano benchmark [38], and the pBOB benchmark [12]. The running times of the benchmarks ranged from 1.1 to 4.8 seconds.…”

Section: Methodsmentioning

confidence: 99%

A framework for reducing the cost of instrumented code

Arnold

Ryder

2001

Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation

257

153

View full text Add to dashboard Cite

Instrumenting code to collect profiling information can canse substantial execution overhead. This overhead makes instrumentation difficult to perform at runt/me, often preventing many known o]fiine feedback-directed optimizations from being used in online systems. This paper presents a general framework for performing instrumentation sampling to reduce the overhead of previously expensive instrumentation. The framework is simple and effective, using codeduplication and counter-based sampling to allow switching between instrumented and non-instrumented code.Our framework does not rely on any hardware or operating system support, yet provides a high frequency sample rate that is tunable, allowing the tradeoff between overhead and accuracy to be adjusted easily at runt/me. Experimental results are presented to validate that our technique can collect accurate profiles (93-98% overlap with a perfect profile) with low overhead (averaging ,-,6% total overhead with a naive implementation). A Jalapefio-specific optimization is also presented that reduces overhead further, resulting in an average total overhead of ~3%.

show abstract

Section: Methodsmentioning

confidence: 99%

A framework for reducing the cost of instrumented code

Arnold

Ryder

2001

Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation

257

153

View full text Add to dashboard Cite

show abstract

“…For instance, if we can determine statically that a receiver expression can never point to an extant object, then we s a y i t i s unconditionally non-extant (UCNE). 4 We 4 Sometimes it is convenient to assume a four element lattice f> UC E UC NE ?g, w i t h UCE^UCNE= ?. F or instance, if we k n o w that a reference will always point t o a non-extant object, then we can set its extant state to UCNE.…”

Section: Definition 34 a R Eference ( S U C H A S A R Eceiver Exprementioning

confidence: 99%

A framework for interprocedural optimization in the presence of dynamic class loading

Sreedhar

Burke

Choi

2000

Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

Dynamic class loading during program execution in the Java TM Programming Language is an impediment for generating code that is as e cient as code generated using static wholeprogram analysis and optimization. Whole-program analysis and optimization is possible for languages, such a s C + + , that do not allow new classes and/or methods to be loaded during program execution. One solution for performing wholeprogram analysis and avoiding incorrect execution after a new class is loaded is to invalidate and recompile a ected methods. Runtime invalidation and recompilation mechanisms can be expensive in both space and time, and, therefore, generally restrict optimization. To address these drawbacks, we propose a new framework, called the extant analysis framework, f o r i n terprocedural optimization of programs that support dynamic class (or method) loading. Given a set of classes comprising the closed world, w e perform an o ine static analysis which partitions references into two categories: (1) unconditionally extant references which p o i n t only to objects whose runtime type is guaranteed to be in the closed world and (2) conditionally extant references which p o i n t to objects whose runtime type is not guaranteed to be in the closed world. Optimizations solely dependent on the rst category can be statically performed, and are guaranteed to be correct even with any future class/method loading. Optimizations dependent o n the second category are guarded by dynamic tests, called extant safety tests, for correct execution behavior. We describe the properties for extant safety tests, and provide algorithms for their generation and placement.

show abstract

“…Jigsaw [25] and pBob [5] are two large, multi-packaged server applications. Jigsaw is an object-oriented web server of W3C implemented in Java.…”

Section: Benchmarksmentioning

confidence: 99%

Sealed calls in Java packages

Zaks

Feldman

Aizikowitz

2000

Proceedings of the 15th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications

View full text Add to dashboard Cite

Determining the potential targets of virtual method invocations is essential for inter-procedural optimizations of objectoriented programs. It is generally hard to determine such targets accurately. The problem is especially difficult for dynamic languages such as Java, because additional targets of virtual calls may appear at runtime. Current mechanisms that enable inter-procedural optimizations for dynamic languages, repeatedly validate the optimizations at runtime. This paper addresses this predicament by proposing a novel technique for conservative devirtualization analysis, which applies to a significant number of virtual calls in Java programs. Unlike previous work, our technique requires neither whole program analysis nor runtime information, and incurs no runtime overhead. Our solution is very efficient to compute and is based on a newly introduced, seemingly unrelated security feature of Java file archives. On average, our analysis "seals" (safely devirtualizes) about 39% of the virtual calls (to non-final methods) that appear in SPECjvm98 programs, and about 29% of the calls invoked while executing these programs. In the runtime library rt.jar, about 10% of the packages contain a significant percentage (20-60%) of sealed calls, with a total average of about 8.5%. Most of these calls are also shown to be monomorphic, a fact which can be safely exploited by aggressive inter-procedural optimizations such as direct inlining. These results indicate that our technique has a strong potential for enhancing the analysis and optimization of Java programs.

show abstract

Java server benchmarks

Cited by 28 publications

References 5 publications

A framework for reducing the cost of instrumented code

A framework for reducing the cost of instrumented code

A framework for interprocedural optimization in the presence of dynamic class loading

Sealed calls in Java packages

Contact Info

Product

Resources

About