{"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/pipedream","slug":"pipedream","name":"PipeDream","full_name":"PipeDream","full_name_withheld":false,"description_markdown":"PipeDream is an asynchronous pipeline parallel strategy for training large neural networks. It adds inter-batch pipelining to intra-batch parallelism to further improve parallel training throughput, helping to better overlap computation with communication and reduce the amount of communication when possible.","description_state":"present","introduced_year":2019,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"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":5,"archive_num_papers":null,"papers_newest_first":[{"paper":null,"slug":"graphpipe-improving-performance-and","title":"GraphPipe: Improving Performance and Scalability of DNN Training with Graph Pipeline Parallelism","date":"2024-06-24","arxiv_id":"2406.17145","n_code_links":0,"syntology":null},{"paper":"/paper/pipeoptim-ensuring-effective-1f1b-schedule","slug":"pipeoptim-ensuring-effective-1f1b-schedule","title":"PipeOptim: Ensuring Effective 1F1B Schedule with Optimizer-Dependent Weight Prediction","date":"2023-12-01","arxiv_id":"2312.00839","n_code_links":1,"syntology":null},{"paper":null,"slug":"pipeline-parallelism-for-inference-on","title":"Pipeline Parallelism for Inference on Heterogeneous Edge Computing","date":"2021-10-28","arxiv_id":"2110.14895","n_code_links":0,"syntology":null},{"paper":"/paper/group-based-interleaved-pipeline-parallelism","slug":"group-based-interleaved-pipeline-parallelism","title":"Group-based Interleaved Pipeline Parallelism for Large-scale DNN Training","date":"2021-09-29","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"layerpipe-accelerating-deep-neural-network","title":"LayerPipe: Accelerating Deep Neural Network Training by Intra-Layer and Inter-Layer Gradient Pipelining and Multiprocessor Scheduling","date":"2021-08-14","arxiv_id":"2108.06629","n_code_links":0,"syntology":null}],"papers_shown":5,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":5,"with_a_code_link":2,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":5,"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/edge-computing","name":"Edge-computing","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/image-classification","name":"Image Classification","papers":1},{"task":"/task/machine-translation","name":"Machine Translation","papers":1},{"task":"/task/prediction","name":"Prediction","papers":1},{"task":"/task/scheduling","name":"Scheduling","papers":1},{"task":"/task/sentiment-analysis","name":"Sentiment Analysis","papers":1},{"task":"/task/image-classification","name":"image-classification","papers":1}],"tasks_shown":8,"n_tasks":8,"usage_by_year":[{"year":"2021","papers":3},{"year":"2023","papers":1},{"year":"2024","papers":1}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/pipedream"},"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=PipeDream","read_at":"2026-10-05T01:00:18+00:00","query":"PipeDream","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":"1806.03377"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"mentioned_in_github"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1806.03377","citations":null},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'PipeDream'. 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":"1806.03377","page":"/paper/pipedream-fast-and-efficient-pipeline","syntology_url":"https://syntology.ai/paper/1806.03377","in_graph_layer":false,"samples":0},"line":"repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: mentioned on GitHub). The lookup matched a paper by its title, arXiv:1806.03377, not a method entry. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:1806.03377) is about this method is not checked.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"5a89a0042a30e0af9384328ff982304f7a38dfb37b545a4fc1b832d6037a1acc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}