research-article

Open access

Approximating Type Stability in the Julia JIT (Work in Progress)

Author:

Artem PelenitsynAuthors Info & Claims

VMIL 2023: Proceedings of the 15th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages

Pages 83 - 87

https://doi.org/10.1145/3623507.3623556

Published: 19 October 2023 Publication History

PDF eReader

Abstract

Julia is a dynamic language for scientific computing. For a dynamic language, Julia is surprisingly typeful. Types are used not only to structure data but also to guide dynamic dispatch – the main design tool in the language. No matter the dynamism, Julia is performant: flexibility is compiled away at the run time using a simple but smart type-specialization based optimization technique called type stability. Based on a model of a JIT mimicking Julia from previous works, we present the first algorithm to approximate type stability of Julia code. Implementation and evaluation of the algorithm is still a work in progress.

References

[1]

Gerald Aigner and Urs Hölzle. 1996. Eliminating Virtual Function Calls in C++ Programs. In European Conference on Object-Oriented Programming (ECOOP). https://doi.org/10.1.1.7.7766

Crossref

Google Scholar

[2]

Jeff Bezanson, Jiahao Chen, Benjamin Chung, Stefan Karpinski, Viral B. Shah, Jan Vitek, and Lionel Zoubritzky. 2018. Julia: Dynamism and Performance Reconciled by Design. Proc. ACM Program. Lang., 2, OOPSLA (2018), https://doi.org/10.1145/3276490

Digital Library

Google Scholar

[3]

Jeff Bezanson, Alan Edelman, Stefan Karpinski, and Viral B. Shah. 2017. Julia: A Fresh Approach to Numerical Computing. SIAM Rev., 59, 1 (2017), https://doi.org/10.1137/141000671

Digital Library

Google Scholar

[4]

Benjamin Chung. 2023. A Type System for Julia. Ph.D. Dissertation. Northeastern University.

Google Scholar

[5]

Artem Pelenitsyn, Julia Belyakova, Benjamin Chung, Ross Tate, and Jan Vitek. 2021. Type Stability in Julia: Avoiding Performance Pathologies in JIT Compilation. Proc. ACM Program. Lang., 5, OOPSLA (2021), Article 150, 26 pages. https://doi.org/10.1145/3485527

Digital Library

Google Scholar

[6]

Francesco Zappa Nardelli, Julia Belyakova, Artem Pelenitsyn, Benjamin Chung, Jeff Bezanson, and Jan Vitek. 2018. Julia Subtyping: A Rational Reconstruction. Proc. ACM Program. Lang., 2, OOPSLA (2018), https://doi.org/10.1145/3276483

Digital Library

Google Scholar

Index Terms

Approximating Type Stability in the Julia JIT (Work in Progress)
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
      1. Just-in-time compilers

Recommendations

Type stability in Julia: avoiding performance pathologies in JIT compilation

As a scientific programming language, Julia strives for performance but also provides high-level productivity features. To avoid performance pathologies, Julia users are expected to adhere to a coding discipline that enables so-called type stability. ...
Julia: dynamism and performance reconciled by design

Julia is a programming language for the scientific community that combines features of productivity languages, such as Python or MATLAB, with characteristics of performance-oriented languages, such as C++ or Fortran. Julia's productivity features include:...
World age in Julia: optimizing method dispatch in the presence of eval

Dynamic programming languages face semantic and performance challenges in the presence of features, such as eval, that can inject new code into a running program. The Julia programming language introduces the novel concept of world age to insulate ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

VMIL 2023: Proceedings of the 15th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages

October 2023

99 pages

ISBN:9798400704017

DOI:10.1145/3623507

General Chairs:
Andrea Rosà
USI Lugano, Switzerland
,
Martin Henz
National University of Singapore, Singapore

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].

In-Cooperation

SIGAda: ACM Special Interest Group on Ada Programming Language

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 October 2023

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

VMIL '23

Sponsor:

SIGPLAN

VMIL '23: 15th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages

October 23, 2023

Cascais, Portugal

Acceptance Rates

Overall Acceptance Rate 4 of 4 submissions, 100%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
160
Total Downloads

Downloads (Last 12 months)141
Downloads (Last 6 weeks)16

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Index Terms

Recommendations

Type stability in Julia: avoiding performance pathologies in JIT compilation

Julia: dynamism and performance reconciled by design

World age in Julia: optimizing method dispatch in the presence of eval