Back to search

Michigan Technological University

Plackett and Burman analysis to select effective compiler optimizations

Abstract

dc:description.abstract

Compiler optimizations help to make code run faster at runtime. When the compilation is done before the program is run, compilation time is less of an issue, but how do on-the-fly compilation and optimization impact the overall runtime? If the compiler must compete with the running application for resources, the running application will take more time to complete. This paper investigates the impact of specific compiler optimizations on the overall runtime of an application. A foldover Plackett and Burman design is used to choose compiler optimizations that appear to contribute to shorter overall runtimes. These selected optimizations are compared with the default optimization levels in the Jikes RVM. This method selects optimizations that result in a shorter overall runtime than the default O0, O1, and O2 levels. This shows that careful selection of compiler optimizations can have a significant, positive impact on overall runtime.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Computer Science (MS)
Level thesis:degree_level
Master's report
Discipline thesis:degree_discipline
Department of Computer Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Larson, Dustin
Contributors dc:contributor
  • Steven M. Carr
  • Zhenlin Wang

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Michigan Technological University
Base URL
digitalcommons.mtu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Larson, Dustin. Plackett and Burman analysis to select effective compiler optimizations. Master's report thesis, https://doi.org/10.37099/mtu.dc.etds/538