12 citations · 44 across the 10 of their papers we have counts for
10 papers
In-situ Indexing via Memristive Content-Addressable Memory
Bing Wu, Xueliang Wei, Shiyi Song +6
Processing-in-Memory (PIM) is a proven paradigm for overcoming the ``memory wall". However, while data indexing is severely bottlenecked by this same wall, it remains unclear how i…
Optimizing Frequent Checkpointing via Low-Cost Differential for Distributed Training Systems
Chenxuan Yao, Yuchong Hu, Feifan Liu +4
Distributed training of large deep-learning models often leads to failures, so checkpointing is commonly employed for recovery. State-of-the-art studies focus on frequent checkpoin…
Multi-level Forwarding and Scheduling Recovery Algorithm in Rapidly-changing Network for Erasure-coded Clusters
Hai Zhou, Dan Feng, Yuchong Hu
A key design goal of erasure-coded clusters is to reduce the repair time. The existing Erasure-coded data repair schemes are roughly classified into two categories: 1. Designing ra…
Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation
Xiaolu Li, Zuoru Yang, Jinhong Li +4
We propose repair pipelining, a technique that speeds up the repair performance in general erasure-coded storage. By carefully scheduling the repair of failed data in small-size un…
A New Design of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair
Hanxu Hou, Yunghsiang Han, Patrick P. C. Lee +2
Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundan…
Rack-Aware Regenerating Codes for Data Centers
Hanxu Hou, Patrick P. C. Lee, Kenneth W. Shum +1
Erasure coding is widely used for massive storage in data centers to achieve high fault tolerance and low storage redundancy. Since the cross-rack communication cost is often high,…