The impact of meta-tracing on VM design and implementation

Bolz, Carl Friedrich; Tratt, Laurence

doi:10.1016/j.scico.2013.02.001

Cited by 33 publications

(50 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Depending on the result of the comparison, the control low can be transferred to bytecode index 3 or index 7. Hence, the successors array for if_icmplt is [3,7]. The array of successors is important for dynamic compilation (see Section 3.3); it allows the compiler to determine all possible successor bytecodes.…”

Section: Interpretation Of Java Bytecodementioning

confidence: 99%

See 1 more Smart Citation

Applying Optimizations for Dynamically-typed Languages to Java

Grimmer¹,

Marr

Kahlhofer

et al. 2017

Proceedings of the 14th International Conference on Managed Languages and Runtimes

View full text Add to dashboard Cite

While Java is a statically-typed language, some of its features make it behave like a dynamically-typed language at run time. This includes Java's boxing of primitive values as well as generics, which rely on type erasure. This paper investigates how runtime technology for dynamically-typed languages such as JavaScript and Python can be used for Java bytecode. Using optimistic optimizations, we specialize bytecode instructions that access references in such a way, that they can handle primitive data directly and also specialize data structures in order to avoid boxing for primitive types. Our evaluation shows that these optimizations can be successfully applied to a statically-typed language such as Java and can also improve performance signiicantly. With this approach, we get an eicient implementation of Java's generics, avoid changes to the Java language, and maintain backwards compatibility, allowing existing code to beneit from our optimization transparently.

show abstract

Section: Interpretation Of Java Bytecodementioning

confidence: 99%

“…With respect to the example in Listing 3, the bytecode dispatch node transfers execution between the seven bytecode nodes with indices [1,2,3,4,5,6,7]. Figure 2 shows the bytecode dispatch node for the bytecode in Listing 3 and illustrates the control low with red arrows.…”

Section: Interpretation Of Java Bytecodementioning

confidence: 99%

Applying Optimizations for Dynamically-typed Languages to Java

Grimmer¹,

Marr

Kahlhofer

et al. 2017

Proceedings of the 14th International Conference on Managed Languages and Runtimes

View full text Add to dashboard Cite

show abstract

“…This approach has proven to be very efficient in SELF [5] and has inspired many language implementations (e.g., PyPy [2], and Google's V8 [31]). …”

Section: Self Mapsmentioning

confidence: 99%

Efficient and thread-safe objects for dynamically-typed languages

Daloze¹,

Marr²,

Bonetta³

et al. 2016

Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applicatio

View full text Add to dashboard Cite

“…To identify the limits of RPython's meta-tracing [Bolz et al 2009, Bolz andTratt 2013], we experimented with a simple version of the OMOP (cf. section 2.1).…”

Section: State Of the Art In Metaprogrammingmentioning

confidence: 99%

Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises

2015

View full text Add to dashboard Cite

Runtime metaprogramming enables many useful applications and is often a convenient solution to solve problems in a generic way, which makes it widely used in frameworks, middleware, and domain-specific languages. However, powerful metaobject protocols are rarely supported and even common concepts such as reflective method invocation or dynamic proxies are not optimized. Solutions proposed in literature either restrict the metaprogramming capabilities or require application or library developers to apply performance improving techniques.For overhead-free runtime metaprogramming, we demonstrate that dispatch chains, a generalized form of polymorphic inline caches common to self-optimizing interpreters, are a simple optimization at the language-implementation level. Our evaluation with self-optimizing interpreters shows that unrestricted metaobject protocols can be realized for the first time without runtime overhead, and that this optimization is applicable for just-in-time compilation of interpreters based on meta-tracing as well as partial evaluation. In this context, we also demonstrate that optimizing common reflective operations can lead to significant performance improvements for existing applications.

show abstract

The impact of meta-tracing on VM design and implementation

Cited by 33 publications

References 7 publications

Applying Optimizations for Dynamically-typed Languages to Java

Applying Optimizations for Dynamically-typed Languages to Java

Efficient and thread-safe objects for dynamically-typed languages

Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises

Contact Info

Product

Resources

About