ECRM: Efficient Fault Tolerance for Recommendation Model Training via Erasure Coding
Not on the map. Why?
Abstract (arXiv)
Deep-learning-based recommendation models (DLRMs) are widely deployed to serve personalized content to users. DLRMs are large in size due to their use of large embedding tables, and are trained by distributing the model across the memory of tens or hundreds of servers. Server failures are common in such large distributed systems and must be mitigated to enable training to progress. Checkpointing is the primary approach used for fault tolerance in these systems, but incurs significant training-time overhead both during normal operation and when recovering from failures. As these overheads increase with DLRM size, checkpointing is slated to become an even larger overhead for future DLRMs, which are expected to grow in size. This calls for rethinking fault tolerance in DLRM training. We present ECRM, a DLRM training system that achieves efficient fault tolerance using erasure coding. ECRM chooses which DLRM parameters to encode, correctly and efficiently updates parities, and enables training to proceed without any pauses, while maintaining consistency of the recovered parameters. We implement ECRM atop XDL, an open-source, industrial-scale DLRM training system. Compared to checkpointing, ECRM reduces training-time overhead for large DLRMs by up to 88%, recovers from failures up to 10.3× faster, and allows training to proceed during recovery. These results show the promise of erasure coding in imparting efficient fault tolerance to training current and future DLRMs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 45 references that are in the map. First posted on arXiv 5 Apr 2021.
Builds on
21 of 45 references.
References · 21
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019Deep Learning Recommendation Model for Personalization and Recommendation Systemscited by 327
- 2019The Architectural Implications of Facebook's DNN-based Personalized Recommendationcited by 83
- 2015Speeding Up Distributed Machine Learning Using Codescited by 76
- 2018Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacycited by 66
- 2021TT-Rec: Tensor Train Compression for Deep Learning Recommendation Modelscited by 58
- 2020DeepRecSys: A System for Optimizing End-To-End At-scale Neural Recommendation Inferencecited by 54
- 2020Understanding Training Efficiency of Deep Learning Recommendation Models at Scalecited by 43
- 2019Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systemscited by 41
- 2021RecSSD: Near Data Processing for Solid State Drive Based Recommendation Inferencecited by 35
- 2020Understanding Capacity-Driven Scale-Out Neural Recommendation Inferencecited by 29
- 2020Is Network the Bottleneck of Distributed Training?cited by 19
9 more
- 2020Mixed-Precision Embedding Using a Cachecited by 18
- 2020Optimizing Deep Learning Recommender Systems' Training On CPU Cluster Architecturescited by 17
- 2018Bandana: Using Non-volatile Memory for Storing Deep Learning Modelscited by 14
- 2020CPR: Understanding and Improving Failure Tolerant Training for Deep Learning Recommendation with Partial Recoverycited by 11
- 2018A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Matrix Multiplicationcited by 8
- 2018Fault Tolerance in Iterative-Convergent Machine Learningcited by 7
- 2020On Efficient Constructions of Checkpointscited by 6
- 2013XORing Elephants: Novel Erasure Codes for Big Datacited by 2
- 2020MicroRec: Efficient Recommendation Inference by Hardware and Data Structure Solutionscited by 2
Built on by
Not cited yet.