{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/distdgl","slug":"distdgl","name":"DistDGL","full_name":"DistDGL","full_name_withheld":false,"description_markdown":"**DistDGL** is a system for training GNNs in a mini-batch fashion on a cluster of machines. It is is based on the Deep Graph Library (DGL), a popular GNN development framework. DistDGL distributes the graph and its associated data (initial features and embeddings) across the machines and uses this distribution to derive a computational decomposition by following an owner-compute rule. DistDGL follows a synchronous training approach and allows ego-networks forming the mini-batches to include non-local nodes. To minimize the overheads associated with distributed computations, DistDGL uses a high-quality and light-weight mincut graph partitioning algorithm along with multiple balancing constraints. This allows it to reduce communication overheads and statically balance the computations. It further reduces the communication by replicating halo nodes and by using sparse embedding updates. The combination of these design choices allows DistDGL to train high-quality models while achieving high parallel efficiency and memory scalability","description_state":"present","introduced_year":null,"introduced_by":{"title":"DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphs","paper":"/paper/distdgl-distributed-graph-neural-network","first_author":"Da Zheng","n_authors":9,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/distdgl-distributed-graph-neural-network"},"source":{"url":"https://arxiv.org/abs/2010.05337v3","title":"DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphs","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Distributed Methods","url":"/methods/category/distributed-methods","pwc_aliases":[]}],"n_papers_tagged":7,"archive_num_papers":7,"papers_newest_first":[{"paper":"/paper/massivegnn-efficient-training-via-prefetching","slug":"massivegnn-efficient-training-via-prefetching","title":"MassiveGNN: Efficient Training via Prefetching for Massively Connected Distributed Graphs","date":"2024-10-30","arxiv_id":"2410.22697","n_code_links":1,"syntology":null},{"paper":"/paper/entropy-aware-training-for-fast-and-accurate","slug":"entropy-aware-training-for-fast-and-accurate","title":"Entropy Aware Training for Fast and Accurate Distributed GNN","date":"2023-11-04","arxiv_id":"2311.02399","n_code_links":1,"syntology":null},{"paper":null,"slug":"batchgnn-efficient-cpu-based-distributed-gnn","title":"BatchGNN: Efficient CPU-Based Distributed GNN Training on Very Large Graphs","date":"2023-06-23","arxiv_id":"2306.13814","n_code_links":0,"syntology":null},{"paper":"/paper/communication-efficient-graph-neural-networks","slug":"communication-efficient-graph-neural-networks","title":"Communication-Efficient Graph Neural Networks with Probabilistic Neighborhood Expansion Analysis and Caching","date":"2023-05-04","arxiv_id":"2305.03152","n_code_links":2,"syntology":null},{"paper":"/paper/distributed-graph-embedding-with-information","slug":"distributed-graph-embedding-with-information","title":"Distributed Graph Embedding with Information-Oriented Random Walks","date":"2023-03-28","arxiv_id":"2303.15702","n_code_links":1,"syntology":null},{"paper":null,"slug":"distgnn-mb-distributed-large-scale-graph","title":"DistGNN-MB: Distributed Large-Scale Graph Neural Network Training on x86 via Minibatch Sampling","date":"2022-11-11","arxiv_id":"2211.06385","n_code_links":0,"syntology":null},{"paper":"/paper/distdgl-distributed-graph-neural-network","slug":"distdgl-distributed-graph-neural-network","title":"DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphs","date":"2020-10-11","arxiv_id":"2010.05337","n_code_links":1,"syntology":null}],"papers_shown":7,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":7,"with_a_code_link":5,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":7,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/graph-partitioning","name":"graph partitioning","papers":3},{"task":null,"name":"CPU","papers":2},{"task":null,"name":"GPU","papers":2},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":2},{"task":"/task/fraud-detection","name":"Fraud Detection","papers":1},{"task":"/task/graph-embedding","name":"Graph Embedding","papers":1},{"task":"/task/link-prediction","name":"Link Prediction","papers":1},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":1},{"task":"/task/representation-learning","name":"Representation Learning","papers":1}],"tasks_shown":9,"n_tasks":9,"usage_by_year":[{"year":"2020","papers":1},{"year":"2022","papers":1},{"year":"2023","papers":4},{"year":"2024","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/distdgl"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=DistDGL","read_at":"2026-10-05T00:55:10+00:00","query":"DistDGL","kind":"paper","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2010.05337"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2010.05337","repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2010.05337","citations":340},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'DistDGL'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2010.05337","page":"/paper/distdgl-distributed-graph-neural-network","syntology_url":"https://syntology.ai/paper/2010.05337","in_graph_layer":false,"samples":0},"line":"repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). The lookup matched a paper by its title, arXiv:2010.05337, not a method entry. This answer is about arXiv:2010.05337, the paper the archive credits with this method.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"e2a391b18f32f5f62098c7663d8ff90ca12241c7e362d33b823bac3883f53799","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}