Ashish Venkat

Ashish Venkat

Auto-generated profile, based on publicly available information

Ashish Venkat

University of Virginia

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
25 March 2016
Verified
Conference Paper
Open access
AVAshish Venkat
Ashish Venkat
SSSriskanda Shamasunder
Sriskanda Shamasunder
HSHovav Shacham
Hovav Shacham
DTDean M. Tullsen
Dean M. Tullsen
Heterogeneous Chip Multiprocessors have been shown to provide significant performance and energy efficiency gains over homogeneous designs. Recent research has expanded the dimensions of heterogeneity to include diverse Instruction Set Architectures, called Heterogeneous-ISA Chip Multiprocessors. This work leverages such an architecture to realize substantial new security benefits, and in particular, to thwart Return-Oriented Programming. This paper proposes a novel security defense called HIPStR -- Heterogeneous-ISA Program State Relocation -- that performs dynamic randomization of run-time program state, both within and across ISAs. This technique outperforms the state-of-the-art just-in-time code reuse (JIT-ROP) defense by an average of 15.6%, while simultaneously providing greater security guarantees against classic return-into-libc, ROP, JOP, brute force, JIT-ROP, and several evasive variants.

18 January 2024 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
LWLingxi Wu
Lingxi Wu
MZMinxuan Zhou
Minxuan Zhou
WXWeihong Xu
Weihong Xu
AVAshish Venkat
Ashish Venkat
TRTajana Rosing
Tajana Rosing
KSKevin Skadron
Kevin Skadron
This work seeks to leverage Processing-with-storage-technology (PWST) to accelerate a key bioinformatics kernel called k -mer counting, which involves processing large files of sequence data on the disk to build a histogram of fixed-size genome sequence substrings and thereby entails prohibitively high I/O overhead. In particular, this work proposes a set of accelerator designs called Abakus that offer varying degrees of tradeoffs in terms of performance, efficiency, and hardware implementation complexity. The key to these designs is a set of domain-specific hardware extensions to accelerate the key operations for k -mer counting at various levels of the SSD hierarchy, with the goal of enhancing the limited computing capabilities of conventional SSDs, while exploiting the parallelism of the multi-channel, multi-way SSDs. Our evaluation suggests that Abakus can achieve 8.42×, 6.91×, and 2.32× speedup over the CPU-, GPU-, and near-data processing solutions.

23 March 2026 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
ASAkhil Shekar
Akhil Shekar
KGKevin Gaffney
Kevin Gaffney
MPMartin Prammer
Martin Prammer
KKKhyati Kiyawat
Khyati Kiyawat
LWLingxi Wu
Lingxi Wu
KSKevin Skadron
Kevin Skadron
In-memory database query processing frequently involves substantial data transfers between the CPU and memory, leading to inefficiencies due to the Von Neumann bottleneck. Processing-in-Memory (PIM) architectures offer a viable solution to alleviate this bottleneck. In our study, we employ a commonly used software approach that streamlines JOIN operations into simpler selection or filtering tasks via pre-join denormalization, thereby making the query processing workload more amenable to PIM acceleration. This research explores the DRAM design landscape to evaluate how effectively these filtering tasks can be executed efficiently across the DRAM hierarchy and their effect on overall application speedup. We also find that operations such as aggregates are better executed on the CPU than on PIM. Thus, we propose a cooperative query processing framework that capitalizes on both CPU and PIM strengths, where (i) the DRAM-based PIM block, with its massive parallelism, supports scan operations while (ii) CPU, with its flexible architecture, supports the rest of the query execution. This allows us to utilize both PIM and CPU where appropriate and prevent dramatic changes to the overall system architecture. With these minor modifications to the system architecture and a customized version of the DuckDB database to integrate offloaded scan operations into the CPU-side processing, our methodology enables accurate end-to-end performance evaluations using established analytical benchmarks such as TPC-H and the Star Schema Benchmark (SSB). Our findings show that this novel mapping approach improves performance, delivering a \(5.92x/6.5x\) speedup (TPCH/SSB) compared to a traditional schema and \(3.03-4.05x\) speedup compared to a denormalized schema with \(9-17\%\) memory overhead, depending on the degree of partial denormalization. Further, we provide insights into query selectivity, memory overheads, and software optimizations in the context of PIM-based filtering, which better explain the behavior and performance of these systems across the benchmarks.

25 June 2026 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
FSFarzana Ahmed Siddique
Farzana Ahmed Siddique
DGDeyuan Guo
Deyuan Guo
HAHugo Abbot
Hugo Abbot
KDKyle Durrer
Kyle Durrer
MGMohammadhosein Gholamrezaei
Mohammadhosein Gholamrezaei
KSKevin Skadron
Kevin Skadron
The disparity between processor speed and memory bandwidth has become a growing performance bottleneck, particularly for memory-intensive workloads. Processing-in-Memory (PIM) mitigates this bottleneck by integrating computation directly within DRAM. However, the effectiveness of PIM varies significantly across workloads, architectures, and DRAM technologies, yet it is often assessed using tightly coupled simulators and benchmarks that lack portability and generality. This article extends PIMbench and PIMeval —a generalizable benchmark suite and an extensible PIM simulator to support a broader range of workloads, PIM architectures, and DRAM technologies. This evaluation incorporates roofline analysis and a breakdown of intra-memory execution stages to identify PIM-specific bottlenecks and performance scaling limits. The evaluation spans three classes of digital PIM architectures: subarray-level bit-serial, subarray-level bit-parallel, and bank-level bit-parallel. It further demonstrates how internal DRAM parameters such as subarray count and GDL width impact PIM performance. The code is publicly available at: https://github.com/UVA-LavaLab/PIMeval-PIMbench .

20 July 2026 in ACM SIGMETRICS Performance Evaluation Review
Verified
Journal Article
Open access
Saket UpadhyaySaket Upadhyay
Saket Upadhyay
AVAshish Venkat
Ashish Venkat
Modern web browsers manage millions of dynamic objects across tabs, frames, DOM elements, and JavaScript contexts. However, fine-grained behaviors related to object allocation, lifetime, and memory usage in production browsers remain elusive. Chromium's modular and extensible design, use of specialized memory allocators, and sensitivity to instrumentation overhead further complicate precise object tracking. To this end, we develop a lightweight, thread-safe, and non-intrusive profiling framework. Using this infrastructure, we present an empirical characterization of Chromium's memory object behavior across twelve diverse, user-centric workloads. We examine object lifetime events, size diversity, spatial locality, type diversity, and memory activity, and reflect on their broader software and architectural implications. Our study offers a systems-oriented view into Chromium's architecture and memory behavior, and highlights structural challenges in efficient memory management in large-scale and diverse systems.

19 October 2026 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
LMLogan Moody
Logan Moody
BGBhargav Godala
Bhargav Godala
GPGilles Pokam
Gilles Pokam
AVAshish Venkat
Ashish Venkat
With the stagnation of single-threaded performance, the need for optimizations targeting sequential code performance is greater than ever before. Modern workloads have also been growing in code footprint, exposing a bottleneck in the processor front-end, specifically its inability to maintain a sufficiently high fetch throughput to saturate available execution units. To address them, two optimizations exist in modern processors: (1) Fetch-Directed Instruction Prefetching (FDIP) and (2) the micro-op cache ( μ op cache), both of which improve fetch throughput leading to improved overall performance. However, since they target the same code regions, in the presence of FDIP, the μ op cache becomes mostly redundant as a performance optimization. This work proposes JumpStart : a novel and lightweight mechanism that synergistically exploits hints from FDIP to early-detect a μ op cache miss and wake up the decode pipeline ahead of time, alleviating a key front-end bottleneck.