Akash Kothari

Akash Kothari

Auto-generated profile, based on publicly available information

Akash Kothari

University of Illinois Urbana-Champaign, Urbana, USA

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
20 June 2025
Verified
Conference Paper
Open access
RARussel Arbore
Russel Arbore
XRXavier Routh
Xavier Routh
ANAbdul Rafae Noor
Abdul Rafae Noor
AKAkash Kothari
Akash Kothari
HYHaichao Yang
Haichao Yang
VAVikram Adve
Vikram Adve

1 January 2005
Verified
Book Chapter
Closed access
PDF file
AKAnshul Kothari
Anshul Kothari
SSSubhash Suri
Subhash Suri
YZYunhong Zhou
Yunhong Zhou

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.

7 November 2026
Verified
Conference Paper
Open access
XRXavier Routh
Xavier Routh
ANAbdul Rafae Noor
Abdul Rafae Noor
AKAkash Kothari
Akash Kothari
ZLZheyu Li
Zheyu Li
MAMahbod Afarin
Mahbod Afarin
VAVikram Adve
Vikram Adve

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.