{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/osdp-optimal-sharded-data-parallel-for","title":"OSDP: Optimal Sharded Data Parallel for Distributed Deep Learning","arxiv_id":"2209.13258","date":"2022-09-27","proceeding":null,"authors":["Youhe Jiang","Fangcheng Fu","Xupeng Miao","Xiaonan Nie","Bin Cui"],"abstract":"Large-scale deep learning models contribute to significant performance improvements on varieties of downstream tasks. Current data and model parallelism approaches utilize model replication and partition techniques to support the distributed training of ultra-large models. However, directly deploying these systems often leads to sub-optimal training efficiency due to the complex model architectures and the strict device memory constraints. In this paper, we propose Optimal Sharded Data Parallel (OSDP), an automated parallel training system that combines the advantages from both data and model parallelism. Given the model description and the device information, OSDP makes trade-offs between the memory consumption and the hardware utilization, thus automatically generates the distributed computation graph and maximizes the overall system throughput. In addition, OSDP introduces operator splitting to further alleviate peak memory footprints during training with negligible overheads, which enables the trainability of larger models as well as the higher throughput. Extensive experimental results of OSDP on multiple different kinds of large-scale models demonstrate that the proposed strategy outperforms the state-of-the-art in multiple regards. Our code is available at https://github.com/Youhe-Jiang/OptimalShardedDataParallel.","url_abs":"https://arxiv.org/abs/2209.13258v4","url_pdf":"https://arxiv.org/pdf/2209.13258v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"osdp-optimal-sharded-data-parallel-for","repo_url":"https://github.com/youhe-jiang/ijcai2023-optimalshardeddataparallel","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"osdp-optimal-sharded-data-parallel-for","repo_url":"https://github.com/youhe-jiang/optimalshardeddataparallel","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2209.13258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.13258"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/youhe-jiang/ijcai2023-optimalshardeddataparallel","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/youhe-jiang/optimalshardeddataparallel","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":2},"by_repo_kind":{"official":{"samples":2,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"2e56e94b2df59193","entry":"input_slice","repo":"youhe-jiang/ijcai2023-optimalshardeddataparallel","repo_kind":"official","path":"operator_splitting/operator_splitting.py","file_url":"https://github.com/youhe-jiang/ijcai2023-optimalshardeddataparallel/blob/HEAD/operator_splitting/operator_splitting.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2e56e94b2df59193"}},{"code_sha256_prefix":"65a4b47eb53d0834","entry":"model_forward","repo":"youhe-jiang/ijcai2023-optimalshardeddataparallel","repo_kind":"official","path":"bert/train_bert_large_communication_with_groups.py","file_url":"https://github.com/youhe-jiang/ijcai2023-optimalshardeddataparallel/blob/HEAD/bert/train_bert_large_communication_with_groups.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"65a4b47eb53d0834"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}