Yunmo Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yunmo Zhang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Junqiao Qiu
City University of Hong Kong, Hong Kong, China
4 shared publications - Chun Jason Xue
Mohamed bin Zayed University of Artificial Intelligence
3 shared publications - Hong Xu
The Chinese University of Hong Kong, Hong Kong, China
2 shared publications - Jiacheng Huang
City University of Hong Kong, Hong Kong, China
2 shared publications - Xizhe Yin
University of California, Riverside, Riverside, California, USA
2 shared publications - Qingan Li
Wuhan University, Wuhan, China
1 shared publication
Latest Publications
- 6 November 2026
- Published by Springer Nature
- p. 265-273
GCI: GPU-Centric Concurrent Incremental Analysis on Dynamic Graphs
- 6 November 2026
- Published by Springer Nature
- p. 265-273
GCI: GPU-Centric Concurrent Incremental Analysis on Dynamic Graphs
- Open Access
- 29 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 22 (3) , 1-18
C3: Finding Counting-related Crash Consistency Atomicity Bugs for Persistent Memory
Persistent Memory (PM) technologies provide fast, byte-addressable access to durable storage but face crash consistency challenges, motivating extensive work of testing and verification of PM programs. Central to PM testing tools is the specification of program properties for object persistence order and atomicity. Prior work on PM property inference has focused on ordering properties and offers limited support for reasoning about atomicity. This paper explores a class of important atomicity properties between the container-like arrays and their logical size variables, referred to as the counting correlation. These properties are prevalent in PM programs but are not adequately addressed by existing techniques. We introduce C3, a tool designed to infer these counting-related atomicity properties and detect related bugs in PM programs. Our approach begins by proposing invariants to capture the necessary behaviors of counting-correlated variables. We then utilize symbolic range analysis to extract PM program behaviors, and encode them into SMT constraints. These constraints are checked against the invariants to infer likely PM program properties. Our bug detection method is based on the existing output checking approach, but adapted to be aware of input properties to detect and confirm the atomicity bugs efficiently. Our evaluation shows that C3 has found 14 atomicity bugs (including 11 previously unknown ones) from real-world PM programs.
- 29 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 22 (3) , 1-18
Open AccessC3: Finding Counting-related Crash Consistency Atomicity Bugs for Persistent Memory
Persistent Memory (PM) technologies provide fast, byte-addressable access to durable storage but face crash consistency challenges, motivating extensive work of testing and verification of PM programs. Central to PM testing tools is the specification of program properties for object persistence order and atomicity. Prior work on PM property inference has focused on ordering properties and offers limited support for reasoning about atomicity. This paper explores a class of important atomicity properties between the container-like arrays and their logical size variables, referred to as the counting correlation. These properties are prevalent in PM programs but are not adequately addressed by existing techniques. We introduce C3, a tool designed to infer these counting-related atomicity properties and detect related bugs in PM programs. Our approach begins by proposing invariants to capture the necessary behaviors of counting-correlated variables. We then utilize symbolic range analysis to extract PM program behaviors, and encode them into SMT constraints. These constraints are checked against the invariants to infer likely PM program properties. Our bug detection method is based on the existing output checking approach, but adapted to be aware of input properties to detect and confirm the atomicity bugs efficiently. Our evaluation shows that C3 has found 14 atomicity bugs (including 11 previously unknown ones) from real-world PM programs.
- Open Access
- 8 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 564-579
PIE: Enabling Fast and Scalable Incremental Evolving Graph Analytics on Persistent Memory
- 8 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 564-579
Open AccessPIE: Enabling Fast and Scalable Incremental Evolving Graph Analytics on Persistent Memory
- Open Access
- 27 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 654-670
More Apps, Faster Hot-Launch on Mobile Devices via Fore/Background-aware GC-Swap Co-design
Faster app launching is crucial for the user experience on mobile devices. Apps launched from a background cached state, called hot-launching, have much better performance than apps launched from scratch. To increase the number of hot-launches, leading mobile vendors now cache more apps in the background by enabling swap. Recent work also proposed reducing the Java heap to increase the number of cached apps. However, this paper found that existing methods deteriorate app hot-launch performance while increasing the number of cached apps. To simultaneously improve the number of cached apps and hot-launch performance, this paper proposes Fleet, a foreground/background-aware GC-swap co-design framework. To enhance app-caching capacity, Fleet limits the tracing range of GC to background objects only, avoiding touching long-lifetime foreground objects. To improve hot-launch performance, Fleet identifies objects that will be accessed during the next hot-launch and uses runtime information to guide the swap scheme in the OS. In addition, Fleet aggregates small objects with similar access patterns into the same pages to improve swap efficiency. We implemented Fleet in AOSP and evaluated its performance with different types of apps. Experimental results show that Fleet achieves a 1.59× faster hot-launch time and caches 1.21× more apps than Android.
- 27 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 654-670
Open AccessMore Apps, Faster Hot-Launch on Mobile Devices via Fore/Background-aware GC-Swap Co-design
Faster app launching is crucial for the user experience on mobile devices. Apps launched from a background cached state, called hot-launching, have much better performance than apps launched from scratch. To increase the number of hot-launches, leading mobile vendors now cache more apps in the background by enabling swap. Recent work also proposed reducing the Java heap to increase the number of cached apps. However, this paper found that existing methods deteriorate app hot-launch performance while increasing the number of cached apps. To simultaneously improve the number of cached apps and hot-launch performance, this paper proposes Fleet, a foreground/background-aware GC-swap co-design framework. To enhance app-caching capacity, Fleet limits the tracing range of GC to background objects only, avoiding touching long-lifetime foreground objects. To improve hot-launch performance, Fleet identifies objects that will be accessed during the next hot-launch and uses runtime information to guide the swap scheme in the OS. In addition, Fleet aggregates small objects with similar access patterns into the same pages to improve swap efficiency. We implemented Fleet in AOSP and evaluated its performance with different types of apps. Experimental results show that Fleet achieves a 1.59× faster hot-launch time and caches 1.21× more apps than Android.