Xiongzi Ge
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiongzi Ge has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
Yi Liu
Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China
2 shared publicationsDavid H.C. Du
Department of Computer Science and Engineering, University of Minnesota, Twin Cities, MN, USA
1 shared publicationDavid Hung-Chang Du
Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA
1 shared publicationXiaoxia Huang
Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China
1 shared publication- Xiaoxia Huang
School of Electronics and Communication Engineering, Sun Yat-sen University, Shenzhen, China
1 shared publication
Latest Publications
- 28 July 2016
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 30 (3) , 259-275
Par-BF: A parallel partitioned Bloom filter for dynamic data sets
Compared with a hash table, a Bloom filter (BF) is more space efficient for supporting fast matching through a controllable and acceptable false positive probability. The space size of the basic BF is predetermined based on the expected number of elements to be stored. However, we cannot predict the space scale of a BF for dynamic sets. It is still challenging for the two existing solutions, scalable BF (SBF) and dynamic BF (DBF), to manipulate dynamic data sets with low memory overhead but achieving high performance. This article presents a partitioned BF (Par-BF) for dynamic data sets. Compared with DBF and SBF, Par-BF is able to leverage a sweet spot between high performance and low overhead by a group of formulas to support fast concurrent matching. Specifically, the size and the range of the false positive probability in Par-BF can be deliberately derived. From our trace-driven experimental results, the input/output operations per second of Par-BF outperforms that of DBF and SBF by 10× to 14× and by 3× to 8×, respectively. Besides, through our proposed garbage collection policy, Par-BF consumes less than half of the memory usage of SBF.
- 28 July 2016
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 30 (3) , 259-275
Par-BF: A parallel partitioned Bloom filter for dynamic data sets
Compared with a hash table, a Bloom filter (BF) is more space efficient for supporting fast matching through a controllable and acceptable false positive probability. The space size of the basic BF is predetermined based on the expected number of elements to be stored. However, we cannot predict the space scale of a BF for dynamic sets. It is still challenging for the two existing solutions, scalable BF (SBF) and dynamic BF (DBF), to manipulate dynamic data sets with low memory overhead but achieving high performance. This article presents a partitioned BF (Par-BF) for dynamic data sets. Compared with DBF and SBF, Par-BF is able to leverage a sweet spot between high performance and low overhead by a group of formulas to support fast concurrent matching. Specifically, the size and the range of the false positive probability in Par-BF can be deliberately derived. From our trace-driven experimental results, the input/output operations per second of Par-BF outperforms that of DBF and SBF by 10× to 14× and by 3× to 8×, respectively. Besides, through our proposed garbage collection policy, Par-BF consumes less than half of the memory usage of SBF.
- 13 January 2015
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 58 (9) , 2061-2078
MOLAR: A Cost-Efficient, High-Performance SSD-Based Hybrid Storage Cache
This paper proposes a deMOtion-based, fLash-awARe hybrid storage cache model, named MOLAR, to effectively integrate Flash-based Solid-State Disks (SSDs) into traditional dynamic random access memory (DRAM)-based memory storage systems where SSDs serve as the Tier-2 cache, while DRAM is considered as the Tier-1 cache. We found that conventional cache algorithms designed for DRAM perform poorly in SSDs due to the limited write cycles and asymmetric read/write performance of Flash memory. In MOLAR, a Flash-aware I/O path structure is designed to adapt the asymmetric read and write performance of SSDs and, moreover, to reduce useless write operations. A new control metric, demotion count, is validated to wisely select the evicted blocks from DRAM to reside in the SSD. Besides, for SSD can improve internal data placement from data access hints, the Logical Block Addresses in the SSD are grouped into the long-lived region and the short-lived region self-adaptively via a heuristic control algorithm based on the change of the block demotion count. Through trace-driven simulations, the overall hit ratio in MOLAR outperforms two traditional policies by 1.44–5.34%. The average access latency in SSDs is reduced by 3.5× to 4.5×. Moreover, write amplification is effectively reduced by ∼36% in two typical Flash address-mapping policies.
- 13 January 2015
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 58 (9) , 2061-2078
MOLAR: A Cost-Efficient, High-Performance SSD-Based Hybrid Storage Cache
This paper proposes a deMOtion-based, fLash-awARe hybrid storage cache model, named MOLAR, to effectively integrate Flash-based Solid-State Disks (SSDs) into traditional dynamic random access memory (DRAM)-based memory storage systems where SSDs serve as the Tier-2 cache, while DRAM is considered as the Tier-1 cache. We found that conventional cache algorithms designed for DRAM perform poorly in SSDs due to the limited write cycles and asymmetric read/write performance of Flash memory. In MOLAR, a Flash-aware I/O path structure is designed to adapt the asymmetric read and write performance of SSDs and, moreover, to reduce useless write operations. A new control metric, demotion count, is validated to wisely select the evicted blocks from DRAM to reside in the SSD. Besides, for SSD can improve internal data placement from data access hints, the Logical Block Addresses in the SSD are grouped into the long-lived region and the short-lived region self-adaptively via a heuristic control algorithm based on the change of the block demotion count. Through trace-driven simulations, the overall hit ratio in MOLAR outperforms two traditional policies by 1.44–5.34%. The average access latency in SSDs is reduced by 3.5× to 4.5×. Moreover, write amplification is effectively reduced by ∼36% in two typical Flash address-mapping policies.