PHPing Huang

Ping Huang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Ping Huang has a total of 39 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    GearDB: A GC-free Key-Value Store on HM-SMR Drives with Gear Compaction

    by Ting Yao, Jiguang Wan, Ping Huang, Yiwen Zhang, Changsheng Xie, Xubin He


  • Open Access

    All-Optical Neural Network Tanh Architecture with MZI

    by Ruizhen Wu, Jingjing Chen, Ping Huang, Lin Wang

    Artificial neural networks (ANNs) have been widely used for industrial applications and have played a more and more important role in fundamental research but the electronic-based integrated circuits are limited by Moore's law. Optical neural networks (ONNs) can process information in parallel and have low energy advantages. The MZI with Gridnet or FFTnet can realize the convolution calculation is already proved by lots of researches. But the activation functions still have to use the DA/ADC to do the photoelectric conversion and then be calculated in electronic-based hardware systems. So an optical Tanh architecture with MZI is proposed in this paper for the all-optical neural network's activation function. Which can achieve the accuracy of Lenet-5 with MNIST dataset to 86.49%.

  • Efficient SSD Cache for Cloud Block Storage via Leveraging Block Reuse Distances

    by Ke Zhou, Yu Zhang, Ping Huang, Hua Wang, Yongguang Ji, Bin Cheng, Ying Liu

    Solid State Drives (SSDs) are popularly used for caching in large scale cloud storage systems nowadays. Traditionally, most cache algorithms make replacement upon each miss when cache space is full. However, we observe that in a typical Cloud Block Storage (CBS) system, there is a great percentage of blocks with large reuse distances, which would result in large number of blocks being evicted out of the cache before they ever have a chance to be referenced while they are cached, significantly jeopardizing the cache efficiency. In this article, we propose LEA, Lazy Eviction cache Algorithm, for cloud block storage to efficiently remedy the cache inefficiencies caused by cache blocks with large reuse distances. LEA mainly employs two lists, Lazy Eviction List (LEL) and Block Identity List (BIL), which keep track of two types of victim blocks respectively based on their cache duration when replacements occur, to improve cache efficiency. When a cache miss happens, if the victim block has not resided in cache for longer than its reuse distance, LEA inserts the missed block identity into BIL. Otherwise, it inserts the missed block entry into LEL. We have evaluated LEA by using IO traces collected from Tencent, one of the largest network service providers in the world, and several open source traces. Experimental results show that LEA not only outperforms most of the state-of-the-art cache algorithms in hit ratio, but also greatly reduces the number of SSD writes.


  • Minority Disk Failure Prediction Based on Transfer Learning in Large Data Centers of Heterogeneous Disk Systems

    by Ji Zhang, Ke Zhou, Ping Huang, Xubin He, Ming Xie, Bin Cheng, Yongguang Ji, Yinhu Wang

    The storage system in large scale data centers is typically built upon thousands or even millions of disks, where disk failures constantly happen. A disk failure could lead to serious data loss and thus system unavailability or even catastrophic consequences if the lost data cannot be recovered. While replication and erasure coding techniques have been widely deployed to guarantee storage availability and reliability, disk failure prediction is gaining popularity as it has the potential to prevent disk failures from occurring in the first place. Recent trends have turned toward applying machine learning approaches based on disk SMART attributes for disk failure predictions. However, traditional machine learning (ML) approaches require a large set of training data in order to deliver good predictive performance. In large-scale storage systems, new disks enter gradually to augment the storage capacity or to replace failed disks, leading storage systems to consist of small amounts of new disks from different vendors and/or different models from the same vendor as time goes on. We refer to this relatively small amount of disks as minority disks. Due to the lack of sufficient training data, traditional ML approaches fail to deliver satisfactory predictive performance in evolving storage systems which consist of heterogeneous minority disks. To address this challenge and improve the predictive performance for minority disks in large data centers, we propose a minority disk failure prediction model named TLDFP based on a transfer learning approach. Our evaluation results in two realistic datasets have demonstrated that TLDFP can deliver much more precise results and lower additional maintenance cost, compared to four popular prediction models based on traditional ML algorithms and two state-of-the-art transfer learning methods.


  • SEALDB: An Efficient LSM-tree Based KV Store on SMR Drives with Sets and Dynamic Bands

    by Ting Yao, Zhihu Tan, Jiguang Wan, Ping Huang, Yiwen Zhang, Changsheng Xie, Xubin He

    Key-value (KV) stores play an increasingly critical role in supporting diverse large-scale applications in modern data centers hosting terabytes of KV items which even might reside on a single server due to virtualization purposes. The combination of the ever-growing volume of KV items and storage/application consolidation is driving a trend of high storage density for KV stores. Shingled Magnetic Recording (SMR) represents a promising technology for increasing disk capacity, which however comes with the increased complexity of handling random writes. To take the best advantages of SMR drives, applications are expected to work in an SMR-friendly way. In this work, we present SEALDB, a Log-Structured Merge tree (LSM-tree) based key-value store that is specifically optimized for SMR drives via avoiding random writes and the corresponding write amplification on SMR drives. First, for LSM-trees, SEALDB collects and groups participating data of each compaction into sets. Using a set as the basic unit for compactions, SEALDB improves compaction efficiency by reducing random I/Os. Second, SEALDB creates variable sized bands on original HM-SMR drives, named dynamic bands. Dynamic bands store sets in an SMR-friendly way to eliminate the auxiliary write amplification from SMR drives. Third, SEALDB employs two light-weight garbage collection (GC) policies to further improve the space efficiency. We demonstrate the advantages of SEALDB via extensive experiments with various workloads. Overall, SEALDB delivers impressive performance compared with LevelDB, e.g., $3.42 \times /2.65\times$ faster for random writes (without or with GCs), and $3.96\times$ faster for sequential reads.


  • QoS Promotion in Energy-Efficient Datacenters Through Peak Load Scheduling

    by Cheng Hu, Yuhui Deng, Geyong Min, Ping Huang, Xiao Qin

    In energy-efficient datacenters, when bursty workloads appear, the additional time overhead required for resource gearing will incur a performance degradation. To alleviate this problem, we propose a Peak Load Scheduling Control (PLSC) method to promote the Quality of Service (QoS) of peak loads for modern energy-efficient datacenters. However, peak loads are usually difficult to identify. To overcome this difficulty, PLSC tracks the number of requests residing in a VM by leveraging a two-tier request queue maintained by it. When the number exceeds the capability of the VM, it means that peak loads appear. In this case, PLSC adds some delay-tolerant requests to the secondary queue. The scheduling of requests in the secondary queue is controlled with a lower priority than that of requests in the primary queue. Sequentially, with critical requests maintained in the primary queue, PLSC shortens the response time of critical requests. In addition, PLSC expands the number of QoS-guaranteed requests. Comprehensive experiments are conducted to attest the effectiveness of PLSC, by simulating a typical energy-efficient datacenter. The experimental results show that PLSC significantly promotes the QoS of workloads with a negligible impact on energy saving.


  • Early Identification of Critical Blocks: Making Replicated Distributed Storage Systems Reliable Against Node Failures

    by Juntao Fang, Shenggang Wan, Ping Huang, Changsheng Xie, Xubin He

    In large-scale replicated distributed storage systems consisting of hundreds to thousands of nodes, node failures are not rare and can cause data blocks to lose their replicas and become faulty. A simple but effective approach to prevent data loss from the node failures is to shorten the identification time of faulty blocks, which is determined by both timeouts and check intervals for node states. However, to maintain low repair network traffic, the identification time is actually relatively long and even dominates repair processes of critical blocks. In this paper, we propose a novel scheme, named RICK, to explore potential in the identification time, and thus improve data reliability of replicated distributed storage systems while maintaining a low repair cost. First, by introducing an additional replica state, critical blocks (with two or more lost replicas) have individual short timeouts while sick blocks (with only one lost replica) preserve the long timeouts. Second, by replacing the static check intervals for node states with adaptive ones, the check intervals and the identification time of critical blocks are further shortened, which improves data reliability. Meanwhile, due to the low ratio of critical blocks in all faulty blocks, the repair network traffic remains low. The results from our simulation and prototype implementation show that RICK improves data reliability by a factor of up to 14. Meanwhile, the extra repair network traffic caused by RICK is less than 1.5% of the total network traffic for data repairs.


  • Alleviating Memory Refresh Overhead via Data Compression for High Performance and Energy Efficiency

    by Ke Zhou, Wenjie Liu, Kun Tang, Ping Huang, Xubin He

    DRAM memory suffers from increasingly aggravating refresh penalty, which causes significant performance degradation and power consumption. As memory capacity increases, refresh penalty has become increasingly worse as more rows have to be refreshed. In this work, we propose an effective refresh approach called CAR (Compression-Aware Refresh) to efficiently mitigate refresh overheads. We apply a data compression technique to store data in a compressed format so that the resultant sparse banks need only be partially refreshed. Because of compression, data blocks which are originally distributed across all the constituent chips of a rank only need to be stored in a subset of those chips, leaving banks in the remaining chips not fully occupied. As a result, the memory controller can safely skip refreshing memory rows which contain no useful data without compromising data integrity. Such a compression-aware refresh scheme significantly reduces the refresh and thus improves overall memory performance and energy efficiency. To further take advantage of data compression, we adopt a rank subsetting technique to enable accesses to only those occupied chips for memory requests accessing compressed data blocks. Evaluations using benchmarks from SPEC CPU 2006 and the PARSEC 3.0 on recent DDR4 memory systems have shown that CAR achieves up to 1.66x performance improvement (11.7% on average) and up to 45.9% energy reduction (27.3% on average), and reduce memory traffic by up to 99.9% for zero cache lines intensive workloads with an average of 66.3% across all benchmarks.


  • CoARC: Co-operative, Aggressive Recovery and Caching for Failures in Erasure Coded Hadoop

    by Pradeep Subedi, Ping Huang, Tong Liu, Joseph Moore, Stan Skelton, Xubin He

    Cloud file systems like Hadoop have become a norm for handling big data because of the easy scaling and distributed storage layout. However, these systems are susceptible to failures and data needs to be recovered when a failure is detected. During temporary failures, MapReduce jobs or file system clients perform degraded reads and satisfy the read request. We argue that lack of sharing of the recovered data during degraded reads and recovery of only the requested data block places a heavy strain on the system's network resources and increases the job execution time. To this end, we propose CoARC (Co-operative, Aggressive Recovery and Caching), which is a new data-recovery mechanism for unavailable data during degraded reads in distributed file systems. The main idea is to recover not only the data block that was requested but also other temporarily unavailable blocks in the same strip and cache them in a separate data node. We also propose an LRF (Least Recently Failed) cache replacement algorithm for such a kind of recovery caches. We also show that CoARC significantly reduces the network usage and job runtime in erasure coded Hadoop.