Binbin Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Binbin Xu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Zhirong Shen
Xiamen University, Xiamen, China
2 shared publications - Dmitrii Kaplun
School of Computer Science and Technology/School of Artificial Intelligence, China University of Mining and Technology, Xuzhou 221116, China
1 shared publication - Feng Zhang
Xiamen University, Xiamen, China
1 shared publication - Fulin Nan
School of Informatics, Xiamen University
1 shared publication - Jicheng Chen
Alibaba Group, Hangzhou, China
1 shared publication - Jiebin Zhai
Xiamen University, Xiamen, China
1 shared publication
Latest Publications
- Open Access
- 14 September 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 21 (3) , 1-24
Achieving Tunable Erasure Coding with Cluster-Aware Redundancy Transitioning
Erasure coding has been demonstrated as a storage-efficient means against failures, yet its tunability remains a challenging issue in data centers, which is prone to induce substantial cross-cluster traffic. In this article, we presentClusterRT, a cluster-aware redundancy transitioning approach that can dynamically tailor the redundancy degree of erasure coding in data centers.ClusterRTformulates the data relocation as the maximum flow problem to reduce cross-cluster data transfers. It then designs a parity-coordinated update algorithm, which gathers the parity chunks within the same cluster and leverages encoding dependency to further decrease the cross-cluster update traffic.ClusterRTfinally rotates the parity chunks to balance the cross-cluster transitioning traffic across the data center. Large-scale simulation and Alibaba Cloud ECS experiments show thatClusterRTreduces 94.0% to 96.2% of transitioning traffic and reduces 70.4% to 88.4% of transitioning time.
- 14 September 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 21 (3) , 1-24
Open AccessAchieving Tunable Erasure Coding with Cluster-Aware Redundancy Transitioning
Erasure coding has been demonstrated as a storage-efficient means against failures, yet its tunability remains a challenging issue in data centers, which is prone to induce substantial cross-cluster traffic. In this article, we presentClusterRT, a cluster-aware redundancy transitioning approach that can dynamically tailor the redundancy degree of erasure coding in data centers.ClusterRTformulates the data relocation as the maximum flow problem to reduce cross-cluster data transfers. It then designs a parity-coordinated update algorithm, which gathers the parity chunks within the same cluster and leverages encoding dependency to further decrease the cross-cluster update traffic.ClusterRTfinally rotates the parity chunks to balance the cross-cluster transitioning traffic across the data center. Large-scale simulation and Alibaba Cloud ECS experiments show thatClusterRTreduces 94.0% to 96.2% of transitioning traffic and reduces 70.4% to 88.4% of transitioning time.
- Open Access
- 22 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 17-22
Hawkeyes: Addressing Weak Memory Order in Program Migration Based on Instruction Windows
Migrating memory systems from x86 to ARM can result in weak memory order issues due to memory model differences. This necessitates the addition of memory barriers to prevent such problems. However, current automatic memory barrier insertion approaches fail to identify all potential locations where WMM (Weak Memory Model) bugs may occur and also often overuse unnecessary memory barriers. To address this issue, we propose Hawkeyes, an approach that combines dynamic memory access conflict detection and instruction windows to locate out-of-order memory access issues in multi-threaded programs. Hawkeyes performs compile-time instrumentation to locate all memory conflicts at run time and analyzes the micro-instructions together with the instruction window to identify out-of-order instruction intervals. By comparing such intervals among different threads, Hawkeyes determines the locations that need to maintain order. We validate the correctness of Hawkeyes on open-source libraries and evaluate Hawkeyes on public benchmarks. We demonstrate that Hawkeyes not only pinpoints all the locations where WMM bugs may appear but also achieves high accuracy in barrier insertion.
- 22 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 17-22
Open AccessHawkeyes: Addressing Weak Memory Order in Program Migration Based on Instruction Windows
Migrating memory systems from x86 to ARM can result in weak memory order issues due to memory model differences. This necessitates the addition of memory barriers to prevent such problems. However, current automatic memory barrier insertion approaches fail to identify all potential locations where WMM (Weak Memory Model) bugs may occur and also often overuse unnecessary memory barriers. To address this issue, we propose Hawkeyes, an approach that combines dynamic memory access conflict detection and instruction windows to locate out-of-order memory access issues in multi-threaded programs. Hawkeyes performs compile-time instrumentation to locate all memory conflicts at run time and analyzes the micro-instructions together with the instruction window to identify out-of-order instruction intervals. By comparing such intervals among different threads, Hawkeyes determines the locations that need to maintain order. We validate the correctness of Hawkeyes on open-source libraries and evaluate Hawkeyes on public benchmarks. We demonstrate that Hawkeyes not only pinpoints all the locations where WMM bugs may appear but also achieves high accuracy in barrier insertion.