research-article

One compiler: deoptimization to optimized code

Authors:

Christian Wimmer,

Vojin Jovanovic,

Thomas WürthingerAuthors Info & Claims

CC 2017: Proceedings of the 26th International Conference on Compiler Construction

Pages 55 - 64

https://doi.org/10.1145/3033019.3033025

Published: 05 February 2017 Publication History

Abstract

A multi-tier virtual machine (VM) deoptimizes and transfers last-tier execution to the first-tier execution when a speculative optimization is invalidated. The first-tier target of deoptimization is either an interpreter or code compiled by a baseline compiler. Because such a first-tier execution uses a fixed stack frame layout, this complicates all VM components that need to walk the stack. We propose to use the optimizing compiler also to compile deoptimization target code, i.e., the non-speculative first-tier code where execution continues after a deoptimization. Deoptimization entry points are described with the same scope descriptors used to describe the origin of the deoptimization, i.e., deoptimization is a two-way matching of two scope descriptors describing the same abstract frame at the same virtual program counter. We evaluate this deoptimization approach in a high-performance JavaScript VM. It strictly uses a one-compiler approach, i.e., all frames on the stack originate from the same compiler.

References

[1]

O. Agesen and D. Detlefs. Mixed-mode bytecode execution. Technical report, Sun Microsystems, Inc., 2000.

Digital Library

[2]

B. Alpern, S. Augart, S. M. Blackburn, M. Butrico, A. Cocchi, P. Cheng, J. Dolby, S. Fink, D. Grove, M. Hind, K. S. McKinley, M. Mergen, J. E. B. Moss, T. Ngo, and V. Sarkar. The Jikes Research Virtual Machine project: Building an open-source research community. IBM Systems Journal, 44(2):399–417, 2005.

Digital Library

[3]

M. Arnold, S. J. Fink, D. Grove, M. Hind, and P. F. Sweeney. Adaptive optimization in the Jalape˜no JVM. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 47–65. ACM Press, 2000.

Digital Library

[4]

M. Arnold, S. J. Fink, D. Grove, M. Hind, and P. F. Sweeney. A survey of adaptive optimization in virtual machines. Proceedings of the IEEE, 93(2):449–466, 2005.

[5]

J. R. Bell. Threaded code. Communications ACM, 16(6):370–372, 1973.

Digital Library

[6]

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451–490, 1991.

Digital Library

[7]

B. Daloze, S. Marr, D. Bonetta, and H. Mössenböck. Efficient and thread-safe objects for dynamically-typed languages. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 642–659. ACM Press, 2016.

Digital Library

[8]

G. Duboscq, L. Stadler, T. Würthinger, D. Simon, C. Wimmer, and H. Mössenböck. Graal IR: An extensible declarative intermediate representation. In Proceedings of the Asia-Pacific Programming Languages and Compilers Workshop, 2013.

[9]

G. Duboscq, T. Würthinger, L. Stadler, C. Wimmer, D. Simon, and H. Mössenböck. An intermediate representation for speculative optimizations in a dynamic compiler. In Proceedings of the ACM Workshop on Virtual Machines and Intermediate Languages, 2013.

Digital Library

[10]

M. A. Ertl. Stack caching for interpreters. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 315–327. ACM Press, 1995.

Digital Library

[11]

M. A. Ertl and D. Gregg. The behavior of efficient virtual machine interpreters on modern architectures. In Proceedings of the International Conference on Parallel Processing, pages 403–412. Springer-Verlag, 2001.

Digital Library

[12]

S. J. Fink and F. Qian. Design, implementation and evaluation of adaptive recompilation with on-stack replacement. In Proceedings of the International Symposium on Code Generation and Optimization, pages 241–252. IEEE Computer Society, 2003.

Digital Library

[13]

D. Frampton, S. M. Blackburn, P. Cheng, R. J. Garner, D. Grove, J. E. B. Moss, and S. I. Salishev. Demystifying magic: high-level lowlevel programming. In Proceedings of the International Conference on Virtual Execution Environments, pages 81–90. ACM Press, 2009.

Digital Library

[14]

Y. Futamura. Partial evaluation of computation process–an approach to a compiler-compiler. Systems, Computers, Controls, 2(5):721–728, 1971.

[15]

R. Griesemer. Generation of virtual machine code at startup. In Workshop on Simplicity, Performance and Portability in Virtual Machine Design, 1999.

[16]

U. Hölzle and D. Ungar. A third-generation SELF implementation: Reconciling responsiveness with performance. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 229–243. ACM Press, 1994.

Digital Library

[17]

U. Hölzle and D. Ungar. Optimizing dynamically-dispatched calls with run-time type feedback. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 326–336. ACM Press, 1994.

Digital Library

[18]

U. Hölzle, C. Chambers, and D. Ungar. Debugging optimized code with dynamic deoptimization. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 32–43. ACM Press, 1992.

Digital Library

[19]

T. Kotzmann and H. Mössenböck. Run-time support for optimizations based on escape analysis. In Proceedings of the International Symposium on Code Generation and Optimization, pages 49–60. IEEE Computer Society, 2007.

Digital Library

[20]

S. Marr, B. Daloze, and H. Mössenböck. Cross-language compiler benchmarking: Are we fast yet? In Proceedings of the Dynamic Languages Symposium, pages 120–131. ACM Press, 2016.

Digital Library

[21]

M. Paleczny, C. Vick, and C. Click. The Java HotSpot TM server compiler. In Proceedings of the Java Virtual Machine Research and Technology Symposium, pages 1–12. USENIX, 2001.

Digital Library

[22]

I. Piumarta and F. Riccardi. Optimizing direct threaded code by selective inlining. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 291– 300. ACM Press, 1998.

Digital Library

[23]

Y. Shi, K. Casey, M. A. Ertl, and D. Gregg. Virtual machine showdown: Stack versus registers. ACM Transactions on Architecture and Code Optimization, 4(4), 2008.

Digital Library

[24]

L. Stadler, A. Welc, C. Humer, and M. Jordan. Optimizing R language execution via aggressive speculation. In Proceedings of the Dynamic Languages Symposium, pages 84–95. ACM Press, 2016.

Digital Library

[25]

C. Wimmer, M. Haupt, M. L. Van De Vanter, M. Jordan, L. Daynès, and D. Simon. Maxine: An approachable virtual machine for, and in, Java. ACM Transactions on Architecture and Code Optimization, 9(4): 30:1–30:24, 2013.

Digital Library

[26]

T. Würthinger, C. Wimmer, A. Wöß, L. Stadler, G. Duboscq, C. Humer, G. Richards, D. Simon, and M. Wolczko. One VM to rule them all. In Proceedings of Onward! ACM Press, 2013.

Digital Library

Cited By

Weingarten MTheodoridis TProkopec AKotselidis CProkopec A(2022)Inlining-Benefit Prediction with Interprocedural Partial Escape AnalysisProceedings of the 14th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages10.1145/3563838.3567677(13-24)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3563838.3567677
Mosaner RLeopoldseder DKisling WStadler LMössenböck H(2022)Machine-Learning-Based Self-Optimizing Compiler Heuristics✱Proceedings of the 19th International Conference on Managed Programming Languages and Runtimes10.1145/3546918.3546921(98-111)Online publication date: 14-Sep-2022
https://dl.acm.org/doi/10.1145/3546918.3546921
Flückiger OJečmen JKrynski SVitek JJhala RDillig I(2022)Deoptless: speculation with dispatched on-stack replacement and specialized continuationsProceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3519939.3523729(749-761)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519939.3523729
Show More Cited By

Index Terms

One compiler: deoptimization to optimized code
1. Software and its engineering
  1. Software notations and tools
    1. Compilers

Recommendations

Deoptimization for dynamic language JITs on typed, stack-based virtual machines
VEE '14: Proceedings of the 10th ACM SIGPLAN/SIGOPS international conference on Virtual execution environments

We are interested in implementing dynamic language runtimes on top of language-level virtual machines. Type specialization is a critical optimization for dynamic language runtimes: generic code that handles any type of data is replaced with specialized ...
Graal and truffle: modularity and separation of concerns as cornerstones for building a multipurpose runtime
MODULARITY '14: Proceedings of the companion publication of the 13th international conference on Modularity

Multi-language runtimes providing simultaneously high performance for several programming languages still remain an illusion. Industrial-strength managed language runtimes are built with a focus on one language (e.g., Java or C#). Other languages may ...
Deoptimization for dynamic language JITs on typed, stack-based virtual machines
VEE '14

We are interested in implementing dynamic language runtimes on top of language-level virtual machines. Type specialization is a critical optimization for dynamic language runtimes: generic code that handles any type of data is replaced with specialized ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

CC 2017: Proceedings of the 26th International Conference on Compiler Construction

February 2017

141 pages

ISBN:9781450352338

DOI:10.1145/3033019

General Chair:
Peng Wu
Huawei, USA
,
Program Chair:
Sebastian Hack
Saarland University, Germany

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 February 2017

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CC '17

CC '17: Compiler Construction

February 5 - 6, 2017

TX, Austin, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
494
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)2

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Weingarten MTheodoridis TProkopec AKotselidis CProkopec A(2022)Inlining-Benefit Prediction with Interprocedural Partial Escape AnalysisProceedings of the 14th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages10.1145/3563838.3567677(13-24)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3563838.3567677
Mosaner RLeopoldseder DKisling WStadler LMössenböck H(2022)Machine-Learning-Based Self-Optimizing Compiler Heuristics✱Proceedings of the 19th International Conference on Managed Programming Languages and Runtimes10.1145/3546918.3546921(98-111)Online publication date: 14-Sep-2022
https://dl.acm.org/doi/10.1145/3546918.3546921
Flückiger OJečmen JKrynski SVitek JJhala RDillig I(2022)Deoptless: speculation with dispatched on-stack replacement and specialized continuationsProceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3519939.3523729(749-761)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519939.3523729
Mosaner RLeopoldseder DStadler LMössenböck HKuchen HSinger J(2021)Using machine learning to predict the code size impact of duplication heuristics in a dynamic compilerProceedings of the 18th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes10.1145/3475738.3480943(127-135)Online publication date: 29-Sep-2021
https://dl.acm.org/doi/10.1145/3475738.3480943
Wimmer CStancu CHofer PJovanovic VWögerer PKessler PPliss OWürthinger T(2019)Initialize once, start fast: application initialization at build timeProceedings of the ACM on Programming Languages10.1145/33606103:OOPSLA(1-29)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360610
Yusuf MEl-Mahdy ARohou E(2019)Runtime On-Stack Parallelization of Dependence-Free For-Loops in Binary ProgramsIEEE Letters of the Computer Society10.1109/LOCS.2019.28965592:1(1-4)Online publication date: 1-Mar-2019
https://doi.org/10.1109/LOCS.2019.2896559
D'Elia DDemetrescu C(2018)On-stack replacement, distilledACM SIGPLAN Notices10.1145/3296979.319239653:4(166-180)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3296979.3192396
D'Elia DDemetrescu CFoster JGrossman D(2018)On-stack replacement, distilledProceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3192366.3192396(166-180)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3192366.3192396
Sun HBonetta DHumer CBinder WDubach CXue J(2018)Efficient dynamic analysis for Node.jsProceedings of the 27th International Conference on Compiler Construction10.1145/3178372.3179527(196-206)Online publication date: 24-Feb-2018
https://dl.acm.org/doi/10.1145/3178372.3179527
Würthinger TWimmer CHumer CWöß AStadler LSeaton CDuboscq GSimon DGrimmer M(2017)Practical partial evaluation for high-performance dynamic language runtimesACM SIGPLAN Notices10.1145/3140587.306238152:6(662-676)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3140587.3062381
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten