Phaedrus: Predicting Dynamic Application Behavior with Lightweight Generative Models and LLMs
Application profiling is an indispensable technique for many software development tasks, such as code and memory layout optimizations, where optimization decisions are tailored to
specific program profiles. Unfortunately, modern application codebases exhibit highly variant behavior across different inputs, creating challenges for conventional profiling approaches that rely on a single representative execution instance. In this paper, we propose \textbf{Phaedrus}, a new \textit{compiler-assisted deep learning framework} designed to predict dynamic program behavior across varied execution instances, specifically focusing on dynamic function call prediction. These predicted call sequences are subsequently used to guide input-specific compiler optimizations, producing code specialized for each execution instance.
Traditional profile-guided optimization methods struggle with the input-dependent variability of modern applications, where profiling on different inputs yields divergent application behaviors. To address this, Phaedrus proposes two new approaches: \textit{Application Profile Synthesis (Dynamis)}, a profile-less approach where Large Language Models (LLMs) directly infer dynamic functions based on source code & static compiler analysis, bypassing the need for traditional profiling, and \textit{Application Profile Generalization (Morpheus)}, which uses generative models trained on compressed and augmented \textit{Whole Program Path} (WPP) based function profiles to predict application behavior under unseen inputs. Our experiments show that \textit{Phaedrus} accurately identifies the most frequently executed and runtime-dominated hotspot functions, accounting for up to 85–99% of total execution time. Leveraging these predictions, \textit{Phaedrus} enables superior profile-guided optimizations, delivering an average speedup of 6% (up to 25%) and a binary size reduction of 5.19% (up to 19%), without any program execution. In addition, \textit{Phaedrus} reduces WPP function profile sizes by up to $10^{7}\times$.
Mon 5 OctDisplayed time zone: Pacific Time (US & Canada) change
15:30 - 17:00 | |||
15:30 18mTalk | Spatial and Temporal Decomposition for Faster Translation Validation OOPSLA Benjamin Mikek Georgia Institute of Technology, Chathur Bommineni Georgia Institute of Technology, Qirun Zhang Georgia Institute of Technology, Thomas Reps University of Wisconsin-Madison DOI | ||
15:48 18mTalk | Efficient Extraction for Effectful E-graphs OOPSLA Oliver Flatt University of Washington, Anjali Pal University of Washington, Yihong Zhang University of Washington, Ryan Tjoa Jane Street, Kirsten Graham University of Washington, Alex Fischman University of Washington, Chandrakana Nandi Certora; University of Washington, Eli Rosenthal Google, Zachary Tatlock University of Washington, Haobin Ni University of Washington DOI | ||
16:06 18mTalk | Phaedrus: Predicting Dynamic Application Behavior with Lightweight Generative Models and LLMs OOPSLA Bodhisatwa Chatterjee NVIDIA, Georgia Institute of Technology, Neeraj Jadhav Georgia Institute of Technology, Santosh Pande Georgia Institute of Technology DOI | ||
16:24 18mTalk | Taming the Hydra: Targeted Control-Flow Transformations for Dynamic Symbolic Execution OOPSLA Charitha Saumya Intel, Muhammad Hassan Virginia Tech, Rohan Gangaraju University of Texas at Austin, Milind Kulkarni Purdue University, Kirshanthan Sundararajah Virginia Tech DOI Authorizer link Pre-print | ||