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.

Yanfei Yang

dblp:161/6772 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · conflict

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

Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 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.

Software engineering, system software, and programming languages
2 papers
Runtime systems and virtual machines · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Memory systems · 79% Cloud and datacenter computing · 21%

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

TopicWeightPapersLastEvidence papers
Runtime systems and virtual machines
garbage collection
0.922021
Bridging the performance gap for copy-based garbage collectors atop non-volatile memory · EuroSys 2021
Platinum: A CPU-Efficient Concurrent Garbage Collector for Tail-Reduction of Interactive Services · USENIX ATC 2020
Memory systems
non-volatile memory
0.512021
Bridging the performance gap for copy-based garbage collectors atop non-volatile memory · EuroSys 2021
Memory systems › memory management
NVM-aware memory management
0.512021
Bridging the performance gap for copy-based garbage collectors atop non-volatile memory · EuroSys 2021
Runtime systems and virtual machines › garbage collection
concurrent garbage collection
0.412020
Platinum: A CPU-Efficient Concurrent Garbage Collector for Tail-Reduction of Interactive Services · USENIX ATC 2020
Runtime systems and virtual machines
managed runtime
0.112021
Bridging the performance gap for copy-based garbage collectors atop non-volatile memory · EuroSys 2021
Cloud and datacenter computing › datacenter services › online service systems › internet services
interactive services
0.112020
Platinum: A CPU-Efficient Concurrent Garbage Collector for Tail-Reduction of Interactive Services · USENIX ATC 2020
Cloud and datacenter computing › quality of service
tail latency
0.112020
Platinum: A CPU-Efficient Concurrent Garbage Collector for Tail-Reduction of Interactive Services · USENIX ATC 2020

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

write cache · 1.0prefetching · 1.0non-temporal memory access · 1.0header map · 1.0
YearPublicationVenuePosition
2026 CrossLGNet: Enhanced feature extraction for magnetocardiography via local prediction and global comparison self-supervised learning
Jiaojiao Pang, Yanfei Yang, Zhanyi Liu, Min Xiang, Xiaolin Ning
Expert Syst. Appl.5
2021 Bridging the performance gap for copy-based garbage collectors atop non-volatile memory
abstract
Non-volatile memory (NVM) is expected to revolutionize the memory hierarchy with not only non-volatility but also large capacity and power efficiency. Memory-intensive applications, which are often written in managed languages like Java, would run atop NVM for better cost-efficiency. Unfortunately, such applications may suffer from performance slowdown due to the unmanaged performance gap between DRAM and NVM. This paper studies the performance of a series of Java applications atop NVM and uncovers that the copy-based garbage collection (GC), the mainstream GC algorithm, is an NVM-unfriendly component in JVM. GC becomes a severe performance bottleneck especially when memory resource is scarce. To this end, this paper analyzes the memory behavior of copy-based GC and uncovers that its inappropriate usage on NVM bandwidth is the main reason for its performance slowdown. This paper thus proposes two NVM-aware optimizations: write cache and header map, to effectively manage the limited NVM bandwidth. It further improves the GC performance with hardware instructions like non-temporal memory accesses and prefetching. We have implemented the optimizations on two mainstream copy-based garbage collectors in OpenJDK. Evaluation with various memory-intensive applications shows that our optimizations can improve the GC time, application execution time, application tail latency by up to 2.69×, 11.0%, and 5.09×, respectively.
Yanfei Yang, Mingyu Wu 0001, Haibo Chen 0001, Binyu Zang
EuroSys1
2020 Platinum: A CPU-Efficient Concurrent Garbage Collector for Tail-Reduction of Interactive Services
Mingyu Wu 0001, Ziming Zhao 0003, Yanfei Yang, Haibo Chen 0001, Binyu Zang, Haibing Guan, Sanhong Li, Chuansheng Lu, Tongbao Zhang
USENIX ATC3