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.

He Xian

dblp:383/3822 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0008-2099-4109ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 since 2021Software engineering, systems software and programming languages · 2 · 2 since 2021Computer networks · 1 · 1 first-author · 1 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
2 papers
Memory systems · 75% Storage systems · 25%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 77% Transaction processing and concurrency control · 23%

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

TopicWeightPapersLastEvidence papers
Memory systems
processing-in-memory
1.622025
PUSHtap: PIM-based In-Memory HTAP with Unified Data Storage Format · ASPLOS (3) 2025
UM-PIM: DRAM-based PIM with Uniform & Shared Memory Space · ISCA 2024
Database system architecture and tuning
hybrid transactional and analytical processing
0.912025
PUSHtap: PIM-based In-Memory HTAP with Unified Data Storage Format · ASPLOS (3) 2025
Storage systems
HTAP
0.912025
PUSHtap: PIM-based In-Memory HTAP with Unified Data Storage Format · ASPLOS (3) 2025
Memory systems › processing-in-memory
DRAM-PIM
0.812024
UM-PIM: DRAM-based PIM with Uniform & Shared Memory Space · ISCA 2024
Transaction processing and concurrency control › concurrency control
multiversion concurrency control
0.312025
PUSHtap: PIM-based In-Memory HTAP with Unified Data Storage Format · ASPLOS (3) 2025
Memory systems › memory management
virtual memory
0.212024
UM-PIM: DRAM-based PIM with Uniform & Shared Memory Space · ISCA 2024

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

data placement · 1.7data alignment · 1.7MVCC · 1.7dynamic address mapping · 0.8dual-track memory management · 0.8
YearPublicationVenuePosition
2025 PUSHtap: PIM-based In-Memory HTAP with Unified Data Storage Format
abstract
Hybrid transaction/analytical processing (HTAP) is an emerging database paradigm that supports both online transaction processing (OLTP) and online analytical processing (OLAP) workloads. Computing-intensive OLTP operations, involving row-wise data manipulation, are suitable for row-store format. In contrast, memory-intensive OLAP operations, which are column-centric, benefit from column-store format. This data-format dilemma prevents HTAP systems from concurrently achieving three design goals: performance isolation, data freshness, and workload-specific optimization. Another background technology is Processing-in-Memory (PIM), which integrates computing units (PIM units) inside DRAM memory devices to accelerate memory-intensive workloads, including OLAP. Our key insight is to combine the interleaved CPU access and localized PIM unit access to provide two-dimensional access to address the data format contradictions inherent in HTAP. First, we propose a unified data storage format with novel data alignment and placement techniques to optimize the effective bandwidth of CPUs and PIM units and exploit the PIM's parallelism. Second, we implement the multi-version concurrency control (MVCC) essential for single-instance HTAP. Third, we extend the commercial PIM architecture to support the OLAP operations and concurrent access from PIM and CPU. Experiments show that PUSHtap can achieve 3.4X/4.4X OLAP/OLTP throughput improvement compared to multi-instance PIM-based design.
Yilong Zhao 0004, Mingyu Gao 0001, Huanchen Zhang, Fangxin Liu, Gongye Chen, He Xian, Haibing Guan, Li Jiang 0001
ASPLOS (3)6
2025 Latency-Minimal Decentralized LAM Training with Looped Transformers in Heterogeneous LEO Satellite Constellations
abstract
The traditional approach of transmitting sensing data to ground stations for training large AI models (LAMs) is becoming increasingly impractical due to unstable ground-to-satellite links (GSLs) and growing privacy concerns. Fortunately, the rapid expansion of Low Earth Orbit (LEO) satellite constellations offers a new solution. The increasing number of LEO satellites constitutes a distributed computing network, enabling on-orbit computation without the need for data transmission to ground stations. However, the limited computational resources on satellites result in substantial latency when training edge LAMs directly on a single satellite, and the memory capacity is insufficient to accommodate large models for training. To address these challenges, we propose a latency-optimized decentralized training framework that enables collaborative in-orbit LAM pretraining across heterogeneous LEO satellites without the need for downloading data to the ground. In the proposed architecture, we adopt a looped Transformer architecture that reduces memory usage through cross-layer parameter sharing. To improve training efficiency, we introduce a hybrid parallel training strategy that combines intra-group pipeline parallelism and inter-group data parallelism through satellite grouping. Furthermore, to accommodate heterogeneous satellite capabilities, we formulate an optimization problem for workload balancing and develop a dynamic programming–based strategy to minimize overall system latency. Extensive experiments on a heterogeneous satellite testbed demonstrate that our method significantly outperforms existing baselines in both training speed and memory efficiency.
He Xian, Honggang Yuan, Ting Wang 0001, Yuanming Shi
GLOBECOM1
2024 UM-PIM: DRAM-based PIM with Uniform & Shared Memory Space
abstract
DRAM-based Processing in Memory (PIM) addresses the “memory wall” problem by incorporating computing units (PIM units) into main memory devices for faster and wider local data access. However, critical challenges prevent PIM units from being compatible with existing CPU hosts. Memory interleaving and virtual memory limit the size of contiguous data visible to PIM units that constrains the granularity of PIM tasks. Fine-grained PIM tasks result in significant CPU-PIM offloading overhead, offsetting the speed-up of PIM. Existing PIM systems adopt drastic measures to ensure PIM task offloading efficiency, including isolating PIM memory space and turning off global memory interleaving. These interventions, however, decrease the CPU’s memory bandwidth and introduce extra data transfer, leading to an additional “system memory wall”. This new “wall” must be eliminated before fully embracing the PIM technology. In this work, we propose UM-PIM, a PIM system with interleaved CPU pages and non-interleaved PIM pages coexisting in a Uniform and Shared Memory space. UM-PIM enables zero-copy during PIM task offloading and maintains the CPU’s memory bandwidth while ensuring PIM offloading efficiency. Firstly, we propose a dual-track memory management mechanism consisting of independent page allocation and address translation for the two kinds of pages, respectively. Second, we design UM-PIM interface hardware on the DIMM (with PIMs) side to provide a dynamic address mapping for accelerating the data re-layout. Finally, we provide APIs to reduce PIM-to-PIM communication overhead by optimizing the CPU’s access to PIM pages in different communication modes. We compare UM-PIM with a CPU system and the current PIM systems. Results show negligible performance degradation for CPU workloads ($\lt 0.1 \%$) on UM-PIM, contrasting with the $25.8 \%$ degradation on the current PIM system with memory interleaving switched off. For PIM workloads partitioned to CPU and PIM units, UM-PIM can reduce the CPU time by $4.93 \times$, resulting in an end-to-end $1.96 \times$ speedup on average.
Yilong Zhao 0004, Mingyu Gao 0001, Fangxin Liu, Zongwu Wang, Jin Li 0002, He Xian, Tao Yang 0031, Naifeng Jing, Xiaoyao Liang, Li Jiang 0002
ISCA8