Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.13305 v1 pith:WBOPNDWB submitted 2022-01-31 cs.NE cs.AIcs.LGcs.PL

classification cs.NEcs.AIcs.LGcs.PL
keywords passsequencesshackletonframeworkllvmoptimizingapplicationdifferent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Pith tools