Scott Ryan Young
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Scott Ryan Young has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Harpreet Kaur
Department of Electrical Engineering and IT, Punjab Agricultural University, Ludhiana, Punjab, India
2 shared publications - Kenneth Blair Kent
University of New Brunswick
2 shared publications - Marius Pirvu
IBM Canada, Toronto, Ontario, Canada
2 shared publications - Michael C. Goodyear
Faculty of Computer Science, University of New Brunswick, Fredericton, New Brunswick, Canada
1 shared publication
Latest Publications
- Open Access
- 28 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 63-69
Early Detection of Unsupported Compilations during Prototyping in a Template-based Just-in-Time Compiler
- 28 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 63-69
Open AccessEarly Detection of Unsupported Compilations during Prototyping in a Template-based Just-in-Time Compiler
- Open Access
- 8 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 1114-1121
Lightweight Compilation of Method Invocation Bytecodes in Java
Method invocation bytecodes are a fundamental aspect of class methods and object interactions in object-oriented programming languages. However, their traditional interpretation and compilation techniques often introduce significant overhead, impacting the execution efficiency of applications. Template-based Just-In-Time compilation is a lightweight approach in Eclipse OpenJ9 that leverages pre-defined templates to convert frequently executed code fragments into machine code, significantly cutting down startup times. This paper extends the template-based approach to compilation of method invocation bytecodes in Java, aimed at reducing the overhead associated with compiling methods and improving the overall runtime performance. To demonstrate the effectiveness of the proposed approach, a prototype implementation is developed and evaluated against the industry-standard DaCapo benchmark suite. The evaluation reveals promising results, showcasing notable performance gains in terms of reduced memory footprint, faster startup times, and improved overall execution efficiency. This research contributes to the ongoing efforts in enhancing the performance of Java bytecodes' execution and eventually the Java applications. The insights gained from this study are expected to inspire further research in the domain of bytecode compilation, ultimately benefiting the broader language development community.
- 8 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 1114-1121
Open AccessLightweight Compilation of Method Invocation Bytecodes in Java
Method invocation bytecodes are a fundamental aspect of class methods and object interactions in object-oriented programming languages. However, their traditional interpretation and compilation techniques often introduce significant overhead, impacting the execution efficiency of applications. Template-based Just-In-Time compilation is a lightweight approach in Eclipse OpenJ9 that leverages pre-defined templates to convert frequently executed code fragments into machine code, significantly cutting down startup times. This paper extends the template-based approach to compilation of method invocation bytecodes in Java, aimed at reducing the overhead associated with compiling methods and improving the overall runtime performance. To demonstrate the effectiveness of the proposed approach, a prototype implementation is developed and evaluated against the industry-standard DaCapo benchmark suite. The evaluation reveals promising results, showcasing notable performance gains in terms of reduced memory footprint, faster startup times, and improved overall execution efficiency. This research contributes to the ongoing efforts in enhancing the performance of Java bytecodes' execution and eventually the Java applications. The insights gained from this study are expected to inspire further research in the domain of bytecode compilation, ultimately benefiting the broader language development community.