Dhruv Baronia

Dhruv Baronia

Auto-generated profile, based on publicly available information

Dhruv Baronia

UIUC, Urbana, USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 April 2024
Verified
Conference Paper
Open access
AKAkash Kothari
Akash Kothari
ANAbdul Rafae Noor
Abdul Rafae Noor
MXMuchen Xu
Muchen Xu
HUHassam Uddin
Hassam Uddin
DBDhruv Baronia
Dhruv Baronia
SSSudipta Sengupta
Sudipta Sengupta
As modern hardware architectures evolve to support increasingly diverse, complex instruction sets for meeting the performance demands of modern workloads in image processing, deep learning, etc., it has become ever more crucial for compilers to provide robust support for evolution of their internal abstractions and retargetable code generation support to keep pace with emerging instruction sets. We propose Hydride, a novel approach to compiling for complex, emerging hardware architectures. Hydride uses vendor-defined pseudocode specifications of multiple hardware ISAs to automatically design retargetable instructions for AutoLLVM IR, an extensible compiler IR which consists of (formally defined) language-independent and target-independent LLVM IR instructions to compile to those ISAs, and automatically generated instruction selection passes to lower AutoLLVM IR to each of the specified hardware ISAs. Hydride also includes a code synthesizer that automatically generates code generation support for schedule-based languages, such as Halide, to optimally generate AutoLLVM IR. Our results show that Hydride is able to represent 3,557 instructions combined in x86, Hexagon, ARM architectures using only 397 AutoLLVM IR instructions, including (Intel) SSE2, SSE4, AVX, AVX2, AVX512, (Qualcomm) Hexagon HVX, and (ARM) NEON vector ISAs. We created a new Halide compiler with Hydride using only a formal semantics of Halide IR, leveraging the auto-generated AutoLLVM IR and back-ends for the three hardware architectures. Across kernels from deep learning and image processing, this compiler is able to perform just as well as the mature, production Halide compiler on Hexagon, and outperform on x86 by 8% and ARM by 3%. Hydride also outperforms the production Halide's LLVM back end by 12% on x86, 100% on HVX, and 26% on ARM across the same kernels.

10 June 2025 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
ANAbdul Rafae Noor
Abdul Rafae Noor
DBDhruv Baronia
Dhruv Baronia
AKAkash Kothari
Akash Kothari
MXMuchen Xu
Muchen Xu
CMCharith Mendis
Charith Mendis
VAVikram S. Adve
Vikram S. Adve
Using program synthesis to select instructions for and optimize input programs is receiving increasing attention. However, existing synthesis-based compilers are faced by two major challenges that prohibit the deployment of program synthesis in production compilers: exorbitantly long synthesis times spanning several minutes and hours; and scalability issues that prevent synthesis of complex modern compute and data swizzle instructions, which have been found to maximize performance of modern tensor and stencil workloads. This paper proposes MISAAL, a synthesis-based compiler that employs a novel strategy to use formal semantics of hardware instructions to automatically prune a large search space of rewrite rules for modern complex instructions in an offline stage. MISAAL also proposes a novel methodology to make term-rewriting process in the online stage (at compile-time) extremely lightweight so as to enable programs to compile in seconds. Our results show that MISAAL reduces compilation times by up to a geomean of 16x compared to the state-of-the-art synthesis-based compiler, HYDRIDE. MISAAL also delivers competitive runtime performance against the production compiler for image processing and deep learning workloads, Halide, as well as HYDRIDE across x86, Hexagon and ARM.

12 April 2026
Verified
Conference Paper
Open access
AKAkash Kothari
Akash Kothari
DBDhruv Baronia
Dhruv Baronia
Machine learning (ML) compilers rely on graph-level transformations to enhance the runtime performance of ML models, typically by applying a series of unverified, complex rewrite rules. The rewrite rules must account for the fact that tensor shapes, layouts and ranks may not be known at compile-time (i.e., tensor properties are determined at runtime – for instance, the sequence length of input texts fed into Large Language models is only available at runtime) which makes verifying them challenging. Moreover, compilers must apply rewrites so that they are conditionally applied only when certain constraints on symbolic tensor shapes, layouts, ranks, etc. are satisfied. We propose TensorEgg that enables formal verification of rewrites operating on tensors with polymorphic shapes, ranks and layouts, and uses a tensor rewrite system that applies these rules to ML computational graphs to enable compilation of dynamically-shaped tensors.