Who You Gonna Call: Analyzing the Run-time Call-Site Behavior of Ruby Applications
Applications written in dynamic languages are becoming larger and larger and companies increasingly use multi-million line codebases in production. At the same time, dynamic languages rely heavily on dynamic optimizations, particularly those that reduce the overhead of method calls.
In this work, we study the call-site behavior of Ruby benchmarks that are being used to guide the development of upcoming Ruby implementations such as TruffleRuby and YJIT. We study the interaction of call-site lookup caches, method splitting, and elimination of duplicate call-targets.
We find that these optimizations are indeed highly effective on both smaller and large benchmarks, methods and closures alike, and help to open up opportunities for further optimizations such as inlining. However, we show that TruffleRuby’s splitting may be applied too aggressively on already-monomorphic call-sites, coming at a run-time cost. We also find three distinct patterns in the evolution of call-site behavior over time, which may help to guide novel optimizations. We believe that our results may support language implementers in optimizing runtime systems for large codebases built in dynamic languages.
Wed 7 DecDisplayed time zone: Auckland, Wellington change
15:30 - 17:00
|Execution vs. Parse-Based Language Servers: Tradeoffs and Opportunities for Language-Agnostic Tooling for Dynamic Languages|
Stefan Marr University of Kent, Humphrey Burchell University of Kent, Fabio Niephaus Oracle Labs, PotsdamDOI Pre-print
|Who You Gonna Call: Analyzing the Run-time Call-Site Behavior of Ruby Applications|
Sophie Kaleba University of Kent, Octave Larose University of Kent, Richard Jones University of Kent, Stefan Marr University of KentDOI Pre-print
|Dynamic Pattern Matching with Python|
Tobias Kohn University of Cambridge, UK, Guido van Rossum Python Software Foundation, Gary Brandt Bucher, II Research Affiliates, LLC, Talin , Ivan Levkivskyi Dropbox IrelandDOI Pre-print