Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Université de Montréal

$29,000.00

High-Performance Dynamic Language Implementation

FY 2024-25

Summary
Dynamic programming languages are being used in all areas of the software industry from utilitarian scripts to web apps to embedded systems. Recent surveys show that dynamic languages like Python and JavaScript have surpassed static languages like C and Java in popularity for software development. This is unsurprising due to their ease of use and the large user communities that contribute to the vast collections of ready to use libraries. Current implementations of dynamic languages use highly complex multi-tier designs which nevertheless still lag in terms of execution speed when compared to static languages. The unfortunate consequence is that performance critical applications, such as those in the increasingly important domains of machine learning, data mining, and physical simulation, are usually programmed in static languages and can't benefit from the features of dynamic languages. The long term objectives of the proposed research program is to increase the performance of dynamic languages and to lower the development cost of VMs for these languages. The work outlined in this research proposal builds on our many years of experience developing high-performance implementations of dynamic languages. We plan to continue exploring the Basic Block Versioning (BBV) compilation approach which we have designed and is particularly well suited to lower the cost of dynamic constructs while at the same time being relatively easy to put in place in a Just In Time (JIT) compiler or VM. A promising part of our research is an Ahead Of Time (AOT) variant of BBV which can be applied when a JIT is not an option, or to lower the warmup time of the JIT. We will also explore the use of BBV to perform partial function inlining, an optimization well suited for dynamic languages whose builtin operations are complex but a hot path that is worth inlining often exists. We foresee that BBV can be used to optimize memory allocation, a frequent operation for dynamic languages, so this will be investigated. The knowledge learned from this research will help improve the performance of implementations of dynamic languages, and specifically Scheme and Python in the short-term through our work on the Gambit and Zipi compilers respectively. Moreover, we will work on a toolkit based on BBV that provides an intermediate language for easily building high-performance VMs for any dynamic language.
Program
Discovery Grants Program - Individual
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2022-04318
Name nom
Feeley, Marc
Department département
Informatique et recherche opérationnelle - Informatique et recherche opérationnelle
Organization id
63
Institution établissement
Université de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2022
Award amount
29000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2705
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Software and development
Research subject fr
Logiciels et développement
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
High-Performance Dynamic Language Implementation
Keywords
dynamic programming languages; compilation; code generation; just in time; ahead of time; optimization; code specialization; virtual machines
Application summary
Dynamic programming languages are being used in all areas of the software industry from utilitarian scripts to web apps to embedded systems. Recent surveys show that dynamic languages like Python and JavaScript have surpassed static languages like C and Java in popularity for software development. This is unsurprising due to their ease of use and the large user communities that contribute to the vast collections of ready to use libraries. Current implementations of dynamic languages use highly complex multi-tier designs which nevertheless still lag in terms of execution speed when compared to static languages. The unfortunate consequence is that performance critical applications, such as those in the increasingly important domains of machine learning, data mining, and physical simulation, are usually programmed in static languages and can't benefit from the features of dynamic languages. The long term objectives of the proposed research program is to increase the performance of dynamic languages and to lower the development cost of VMs for these languages. The work outlined in this research proposal builds on our many years of experience developing high-performance implementations of dynamic languages. We plan to continue exploring the Basic Block Versioning (BBV) compilation approach which we have designed and is particularly well suited to lower the cost of dynamic constructs while at the same time being relatively easy to put in place in a Just In Time (JIT) compiler or VM. A promising part of our research is an Ahead Of Time (AOT) variant of BBV which can be applied when a JIT is not an option, or to lower the warmup time of the JIT. We will also explore the use of BBV to perform partial function inlining, an optimization well suited for dynamic languages whose builtin operations are complex but a hot path that is worth inlining often exists. We foresee that BBV can be used to optimize memory allocation, a frequent operation for dynamic languages, so this will be investigated. The knowledge learned from this research will help improve the performance of implementations of dynamic languages, and specifically Scheme and Python in the short-term through our work on the Gambit and Zipi compilers respectively. Moreover, we will work on a toolkit based on BBV that provides an intermediate language for easily building high-performance VMs for any dynamic language.