activity
20212026
most citedPACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy

6 citations · 9 across the 11 of their papers we have counts for

collaborators
Showing 2026Show all

10 papers · 1 filter

cs.RO2026

Human Demonstrations as Post-Training Data for Any Robot Body: Retargeting the Object, Not the Hand

Nagasrikanth Kallakuri

Human demonstrations are today used largely for pretraining vision-language-action models, with little ability to use the same data for target-embodiment or task-oriented training,…

cs.DC2026

Towards Efficient HPC Systems for Agents: Challenges and Opportunities

Yunjia Zheng, Bintang Dwi Marthen, Zachary Pan +5

Coding agents have become real users of high-performance computing (HPC) systems, yet today's HPC abstractions, interfaces, and policies remain designed for human-driven workflows.…

cs.DB2026

TrajectoryDB: A New Database for Agent Trajectories

Yunjia Zheng, Juncheng Yang

AI agents generate rich execution trajectories that capture their interactions with large language models, tools, and external environments. These trajectories are increasingly val…

cs.AI2026

A Year in LLM Serving: Workload Evolution, Caching and Load-Balancing

William Nixon, Jon Durbin, Florian Standhartinger +2

Large Language Model (LLM) serving has become a critical cloud workload, and realistic traces are essential for motivating and benchmarking serving systems. However, existing LLM s…

cs.AI2026

HeadWiseKV: Budgeted Per-Head Cache Residency for Hybrid Long-Context Language Models

Renjie Xie, Juncheng Yang, Aoting Hu +4

Long-context inference retains a growing key--value (KV) cache during decoding, which consumes substantial GPU memory and can reduce generation throughput. This bottleneck remains…

cs.DB2026

Demystifying and Improving Lazy Promotion in Cache Eviction

Qinghan Chen, Muhammad Haekal Muhyidin Al-Araby, Ziyue Qiu +3

Cache eviction algorithms play a critical role in the performance of modern data systems, yet their scalability is often limited by the high computational overhead associated with…

cs.DB2026

LAANN: I/O-Aware Look-Ahead Search for Disk-Based Approximate Nearest Neighbor Search

Dingyi Kang, Juncheng Yang, Bingzhe Li

Approximate nearest neighbor search (ANNS) is a fundamental primitive in large-scale retrieval, recommendation, and AI systems. As vector datasets grow to billions or even trillion…

cs.DC2026

LatentStore: An Efficient Latent-First Storage System for AI-Generated Images

Zirui Wang, Yunjia Zheng, Tingfeng Lan +4

The explosive growth of AI-generated images has created a sustainability challenge for storage infrastructure. Platforms like Midjourney and Adobe Firefly already host billions of…

cs.LG2026

MoE-Prefill: Zero Redundancy Overheads in MoE Prefill Serving

Zhaoyuan Su, Olatunji Ruwase, Karthik Ganesan +5

Production LLM workloads increasingly serve discriminative tasks, such as classification, recommendation, and verification, whose answers are read from the logits of a single prefi…

cs.DC2026

TensorDex: A Compact, Tensor-Centric Storage System for Modern AI Models

Tingfeng Lan, Zirui Wang, Yunjia Zheng +3

Modern model hubs store hundreds of petabytes of large language models (LLMs), with fine-tuned variants dominating the storage footprint. These variants contain substantial cross-m…