Man-Made Heuristics Are Dead. Long Live Code Generators!
Authors:
Preprint
Abstract
Policy design for various systems controllers has conventionally been a manual process, with domain experts carefully tailoring heuristics for the specific instance in which the policy will be deployed. In this paper, we re-imagine policy design via a novel automated search technique fueled by recent advances in generative models, specifically Large Language Model (LLM)-driven code generation. We outline the design and implementation of PolicySmith, a framework that applies LLMs to synthesize instance-optimal heuristics. We apply PolicySmith to two long-standing systems policies - web caching and congestion control, highlighting the opportunities unraveled by this LLM-driven heuristic search. For caching, PolicySmith discovers heuristics that outperform established baselines on standard open-source traces. For congestion control, we show that PolicySmith can generate safe policies that integrate directly into the Linux kernel.Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Mathematical discoveries from program search with large language modelsNature, 2023
- Interpreting Deep Learning-Based Networking Systems2020
- C2TCP: A Flexible Cellular TCP to Meet Stringent Delay RequirementsIEEE Journal on Selected Areas in Communications, 2019
- ROBUS2017
- BBR: Congestion-Based Congestion ControlQueue, 2016
- Programmable Packet Scheduling at Line Rate2016
- Universal Packet Scheduling2015
- TinyLFU: A Highly Efficient Cache Admission Policy2014
- Stochastic superoptimizationACM SIGARCH Computer Architecture News, 2013
- Start-time fair queueing: a scheduling algorithm for integrated services packet switching networksIEEE/ACM Transactions on Networking, 1997