mlsanityData to 7 Oct 2026

Optimizing LLVM Pass Sequences with Shackleton: A Linear Genetic Programming Framework

arXiv 2201.13305 ↗First posted 31 Jan 2022cs.NE cs.AI cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

In this paper we introduce Shackleton as a generalized framework enabling the application of linear genetic programming -- a technique under the umbrella of evolutionary algorithms -- to a variety of use cases. We also explore here a novel application for this class of methods: optimizing sequences of LLVM optimization passes. The algorithm underpinning Shackleton is discussed, with an emphasis on the effects of different features unique to the framework when applied to LLVM pass sequences. Combined with analysis of different hyperparameter settings, we report the results on automatically optimizing pass sequences using Shackleton for two software applications at differing complexity levels. Finally, we reflect on the advantages and limitations of our current implementation and lay out a path for further improvements. These improvements aim to surpass hand-crafted solutions with an automatic discovery method for an optimal pass sequence.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 1 of its 26 references that are in the map. First posted on arXiv 31 Jan 2022.

Builds on

1 of 26 references.

References · 1

  1. 2018Machine Learning in Compiler Optimisationcited by 13

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

2 papers.