Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yupeng Tang

dblp:291/4743 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
6since 2021 · last 2025
0009-0005-8613-6682ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 2 first-author · 3 since 2021Computer networks · 2 · 2 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
6 papers
Memory systems · 55% Cloud and datacenter computing · 39% Parallel and multicore computing · 6%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

Topics — the 14 heaviest of 16, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems
memory disaggregation
1.422025
pulse: Accelerating Distributed Pointer-Traversals on Disaggregated Memory · ASPLOS (1) 2025
MIND: In-Network Memory Management for Disaggregated Data Centers · SOSP 2021
Cloud and datacenter computing
serverless computing
1.122022
Jiffy: elastic far-memory for stateful serverless analytics · EuroSys 2022
Caerus: NIMBLE Task Scheduling for Serverless Analytics · NSDI 2021
Memory systems › memory disaggregation
CXL memory disaggregation
0.912025
pulse: Accelerating Distributed Pointer-Traversals on Disaggregated Memory · ASPLOS (1) 2025
Memory systems
memory interconnect
0.812024
Exploring Performance and Cost Optimization with ASIC-Based CXL Memory · EuroSys 2024
Machine learning › Efficient and distributed learning
inference serving
0.712023
SHEPHERD: Serving DNNs in the Wild · NSDI 2023
Cloud and datacenter computing
cluster resource management and scheduling
0.712023
SHEPHERD: Serving DNNs in the Wild · NSDI 2023
Cloud and datacenter computing
inference serving
0.712023
SHEPHERD: Serving DNNs in the Wild · NSDI 2023
Memory systems › memory disaggregation
far memory
0.612022
Jiffy: elastic far-memory for stateful serverless analytics · EuroSys 2022
Memory systems
remote memory
0.612022
Jiffy: elastic far-memory for stateful serverless analytics · EuroSys 2022
Cloud and datacenter computing › serverless computing
serverless analytics
0.512021
Caerus: NIMBLE Task Scheduling for Serverless Analytics · NSDI 2021
Parallel and multicore computing
task scheduling
0.512021
Caerus: NIMBLE Task Scheduling for Serverless Analytics · NSDI 2021
Memory systems
cache
0.312025
pulse: Accelerating Distributed Pointer-Traversals on Disaggregated Memory · ASPLOS (1) 2025
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.212022
Jiffy: elastic far-memory for stateful serverless analytics · EuroSys 2022
Memory systems › memory management
memory allocation
0.212022
Jiffy: elastic far-memory for stateful serverless analytics · EuroSys 2022

Methods — techniques the papers use, named apart from their topics

energy-efficient execution · 0.9distributed execution · 0.9cost modeling · 0.8benchmarking · 0.8elastic memory allocation · 0.6
YearPublicationVenuePosition
2025 pulse: Accelerating Distributed Pointer-Traversals on Disaggregated Memory
abstract
Caches at CPU nodes in disaggregated memory architectures amortize the high data access latency over the network. However, such caches are fundamentally unable to improve performance for workloads requiring pointer traversals across linked data structures. We argue for accelerating these pointer traversals closer to disaggregated memory in a manner that preserves expressiveness for supporting various linked structures, ensures energy efficiency and performance, and supports distributed execution. We design pulse, a distributed pointer-traversal framework for rack-scale disaggregated memory to meet all the above requirements. Our evaluation of pulse shows that it enables low-latency, high-throughput, and energy-efficient execution for a wide range of pointer traversal workloads on disaggregated memory that fare poorly with caching alone.
Yupeng Tang, SeungSeob Lee, Abhishek Bhattacharjee, Anurag Khandelwal
ASPLOS (1)1
2024 Exploring Performance and Cost Optimization with ASIC-Based CXL Memory
abstract
As memory-intensive applications continue to drive the need for advanced architectural solutions, Compute Express Link (CXL) has risen as a promising interconnect technology that enables seamless high-speed, low-latency communication between host processors and various peripheral devices. In this study, we explore the application performance of ASIC CXL memory in various data-center scenarios. We then further explore multiple potential impacts (e.g., throughput, latency, and cost reduction) of employing CXL memory via carefully designed policies and strategies. Our empirical results show the high potential of CXL memory, reveal multiple intriguing observations of CXL memory and contribute to the wide adoption of CXL memory in real-world deployment environments. Based on our benchmarks, we also develop an Abstract Cost Model that can estimate the cost benefit from using CXL memory.
Yupeng Tang, Henry Hu, Tongping Liu, Jiaxin Shan, Ruoyun Huang, Cheng Zhao 0001, Cheng Chen 0008, Xiaoning Ding, Jianjun Chen 0001
EuroSys1
2023 SHEPHERD: Serving DNNs in the Wild
Hong Zhang 0025, Yupeng Tang, Anurag Khandelwal, Ion Stoica
NSDI2
2022 Jiffy: elastic far-memory for stateful serverless analytics
abstract
Stateful serverless analytics can be enabled using a remote memory system for inter-task communication, and for storing and exchanging intermediate data. However, existing systems allocate memory resources at job granularity---jobs specify their memory demands at the time of the submission; and, the system allocates memory equal to the job's demand for the entirety of its lifetime. This leads to resource underutilization and/or performance degradation when intermediate data sizes vary during job execution.
Anurag Khandelwal, Yupeng Tang, Rachit Agarwal 0001, Aditya Akella, Ion Stoica
EuroSys2
2021 Caerus: NIMBLE Task Scheduling for Serverless Analytics
Hong Zhang 0025, Yupeng Tang, Anurag Khandelwal, Jingrong Chen 0002, Ion Stoica
NSDI2
2021 MIND: In-Network Memory Management for Disaggregated Data Centers
abstract
Memory disaggregation promises transparent elasticity, high resource utilization and hardware heterogeneity in data centers by physically separating memory and compute into network-attached resource "blades". However, existing designs achieve performance at the cost of resource elasticity, restricting memory sharing to a single compute blade to avoid costly memory coherence traffic over the network.
SeungSeob Lee, Yanpeng Yu, Yupeng Tang, Anurag Khandelwal, Lin Zhong 0001, Abhishek Bhattacharjee
SOSP3