RL4ReAl: Reinforcement Learning for Register Allocation

2022-04-05 · S. VenkataKeerthy, Siddharth Jain, Anilava Kundu, Rohit Aggarwal, Albert Cohen, Ramakrishna Upadrasta

We aim to automate decades of research and experience in register allocation, leveraging machine learning. We tackle this problem by embedding a multi-agent reinforcement learning algorithm within LLVM, training it with the state of the art techniques. We formalize the constraints that precisely define the problem for a given instruction-set architecture, while ensuring that the generated code preserves semantic correctness. We also develop a gRPC based framework providing a modular and efficient compiler interface for training and inference. Our approach is architecture independent: we show experimental results targeting Intel x86 and ARM AArch64. Our results match or out-perform the heavily tuned, production-grade register allocators of LLVM.

📄 PDF Abstract BibTeX arXiv:2204.02013

Code (0)

등록된 구현이 없습니다.

Tasks

Hierarchical Reinforcement Learning Multi-agent Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Reinforcement Learning for Graph Coloring: Understanding the Power and Limits of Non-Label Invariant Representations

2024-01-23 · Chase Cummins, Richard Veras

Register allocation is one of the most important problems for modern compilers. With a practically unlimited number of user variables and a small number of CPU registers, assigning variables to registers without conflict…

CPU

VeriLocc: End-to-End Cross-Architecture Register Allocation via LLM

2025-06-20 · Lesheng Jin, Zhenyuan Ruan, Haohui Mai, Jingbo Shang

Modern GPUs evolve rapidly, yet production compilers still rely on hand-crafted register allocation heuristics that require substantial re-tuning for each hardware generation. We introduce VeriLocc, a framework that comb…

GPU

Deep Learning-based Hybrid Graph-Coloring Algorithm for Register Allocation

2019-12-08 · Dibyendu Das, Shahid Asghar Ahmad, Kumar Venkataramanan

Register allocation, which is a crucial phase of a good optimizing compiler, relies on graph coloring. Hence, an efficient graph coloring algorithm is of paramount importance. In this work we try to learn a good heuristi…

CPU Deep Learning

Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation

2024-04-10 · Daniel Biebert, Christian Hakert, Kuan-Hsun Chen, Jian-Jia Chen

Bringing high-level machine learning models to efficient and well-suited machine implementations often invokes a bunch of tools, e.g.~code generators, compilers, and optimizers. Along such tool chains, abstractions have …

C++ code Code Generation CPU

Graph Convolutional Policy for Solving Tree Decomposition via Reinforcement Learning Heuristics

2019-10-18 · Taras Khakhulin, Roman Schutski, Ivan Oseledets

We propose a Reinforcement Learning based approach to approximately solve the Tree Decomposition (TD) problem. TD is a combinatorial problem, which is central to the analysis of graph minor structure and computational co…

reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)Tree Decomposition