Sujay Yadalam

Sujay Yadalam

Auto-generated profile, based on publicly available information

Sujay Yadalam

The University of Texas at Austin, Austin, 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
17 April 2024
Verified
Conference Paper
Open access
SYSujay Yadalam
Sujay Yadalam
CAChloe Alverti
Chloe Alverti
VKVasileios Karakostas
Vasileios Karakostas
JGJayneel Gandhi
Jayneel Gandhi
MSMichael Swift
Michael Swift
Modern storage devices, such as Optane NVMe SSDs, offer ultra-low latency of a few microseconds and high bandwidth of multiple gigabytes per second. At these speeds, the kernel software I/O stack is a substantial source of overhead. Userspace approaches avoid kernel software overheads but face challenges in supporting shared storage without major changes to file systems, the OS or the hardware. We propose a new I/O architecture, BypassD, for fast, userspace access to shared storage devices. BypassD takes inspiration from virtual memory: it uses virtual addresses to access a device and relies on hardware for translation and protection. Like memory-mapping a file, the OS kernel constructs a mapping for file contents in the page table. Userspace I/O requests then use virtual addresses from these mappings to specify which file and file offset to access. BypassD extends the IOMMU hardware to translate file offsets into device Logical Block Addresses. Existing applications require no modifications to use BypassD. Our evaluation shows that BypassD reduces latency for 4KB accesses by 42% compared to standard Linux kernel and performs close to userspace techniques like SPDK that do not support device sharing. By eliminating software overheads, BypassD improves performance of real workloads, such as the WiredTiger storage engine, by ~20%.

21 January 2026 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
KKKonstantinos Kanellis
Konstantinos Kanellis
SYSujay Yadalam
Sujay Yadalam
HCHayden Coffey
Hayden Coffey
SVShivaram Venkataraman
Shivaram Venkataraman
MSMichael Swift
Michael Swift
To meet the memory demands of modern data-intensive applications such as graph processing and machine learning, datacenters are adopting tiered memory architectures that include fast tiers such as locally attached DRAM and slower tiers built using CXL-attached memory. While these newer tiers expand capacity, they have higher access latencies and lower bandwidth, which can lead to application performance degradation. To minimize performance loss, frequently accessed (hot) data must be placed close to the CPU in faster tiers and infrequently accessed (cold) data can be placed in farther, slower memory tiers. Existing software-managed tiering solutions employ heuristics and pre-configured thresholds to determine hot and cold data, and make placement and migration decisions. Unfortunately, due to their use of static thresholds, these systems fail to adapt to different workloads and the underlying hardware, and hence perform poorly. In this paper, we study the relationship between thresholds and parameters used by tiering systems and application performance. We leverage Bayesian Optimization to tune the parameters of three tiering systems: HeMem, Memtis, and HMSDK. We find that applications are sensitive to these parameter values, and that best parameter values vary widely across workloads, inputs, thread counts, memory ratios, and hardware characteristics. Our experiments reveal that the Bayesian optimizer can learn workload behaviors and set parameter values that result in best performance. With proper parameter tuning, performance can improve by up to 2x compared to default configurations, highlighting the importance of parameter selection for memory tiering systems.

14 May 2025
Verified
Conference Paper
Open access
DSDivyanshu Saxena
Divyanshu Saxena
JCJiayi Chen
Jiayi Chen
SYSujay Yadalam
Sujay Yadalam
YRYeonju Ro
Yeonju Ro
RDRohit Dwivedula
Rohit Dwivedula
MSMichael Swift
Michael Swift

13 October 2025
Verified
Conference Paper
Open access
KKKonstantinos Kanellis
Konstantinos Kanellis
SYSujay Yadalam
Sujay Yadalam
SVShivaram Venkataraman
Shivaram Venkataraman
MSMichael Swift
Michael Swift

13 October 2025
Verified
Conference Paper
Open access
ATAditya Atul Tewari
Aditya Atul Tewari
SYSujay Yadalam
Sujay Yadalam
APArthur Michener Peters
Arthur Michener Peters
SASaurabh Agarwal
Saurabh Agarwal
AAAditya Akella
Aditya Akella
CRChristopher J. Rossbach
Christopher J. Rossbach

28 September 2026
Verified
Conference Paper
Open access
HCHayden Coffey
Hayden Coffey
SYSujay Yadalam
Sujay Yadalam
APAshwin Poduval
Ashwin Poduval
VBVinay Banakar
Vinay Banakar
SVShivaram Venkataraman
Shivaram Venkataraman
MSMichael M. Swift
Michael M. Swift