Equality Saturation in a Real-World Machine Learning Compiler

Add to your list(s) Download to your calendar using vCal

• Alex Zinenko
• Wednesday 12 February 2025, 16:00-20:00
• Computer Laboratory, William Gates Building, LT1.

If you have a question about this talk, please contact luisa.cicolini.

Join us for a relaxed chat about compilers, while socializing over refreshments. Our social is open to students, academics, professional developers and really anyone interested in compilation. We welcome beginners as well as experts. Our social is an unguided space offered for you to get to know people, try out some new ideas, get feedback on your code, or pair-program on a difficult program. Come with just a paper notebook or bring your laptop to hack on some in-progress patches.

This social is traditionally organized by the LLVM community, but is open to all (potential) compiler enthusiasts. For the first time, the next Compiler Social Talk is part of the department’s Wednesday Seminar.

Equality Saturation in a Real-World Machine Learning Compiler

Machine learning (ML) compilers rely on graph-level transformations to enhance the runtime performance of ML models. However, these program transformations are often driven by manually-tuned compiler heuristics, which are quickly rendered obsolete by new hardware and model architectures. Instead, we propose the use of equality saturation. We replace such heuristics with a more robust global performance model, which accounts for downstream transformations. While this approach still requires a global performance model to evaluate the profitability of transformations,it holds significant promise for increased automation and adaptability. We address challenges in applying equality saturation on real-world ML compute graphs and state-of-the-art hardware, study different cost modeling approaches to deal with fusion and layout optimization, and tackle scalability issues that arise from considering a very wide range of algebraic optimizations. Our implementation builds on and improves the XLA compilation pipeline for CPU and GPU .

This talk is the second one in our compiler social, the first talk will be given by George Constantinides: https://talks.cam.ac.uk/talk/index/225220

Please register if you’re planning to attend: https://grosser.science/compiler-social-2025-02-12/

This talk is part of the compiler socials series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Computer Architecture Group Meeting
• Computer Laboratory, William Gates Building, LT1
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• compiler socials

Note that ex-directory lists are not shown.