{"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-2bw","slug":"pipedream-2bw","name":"PipeDream-2BW","full_name":"PipeDream-2BW","full_name_withheld":false,"description_markdown":"**PipeDream-2BW** is an asynchronous pipeline parallel method that supports memory-efficient pipeline parallelism, a hybrid form of parallelism that combines data and model parallelism with input pipelining. PipeDream-2BW uses a novel pipelining and weight gradient coalescing strategy, combined with the double buffering of weights, to ensure high throughput, low memory footprint, and weight update semantics similar to data parallelism. In addition, PipeDream2BW automatically partitions the model over the available hardware resources, while respecting hardware constraints such as memory capacities of accelerators, and topologies and bandwidths of interconnects. PipeDream-2BW also determines when to employ existing memory-savings techniques, such as activation recomputation, that trade off extra computation for lower memory footprint.\r\n\r\nThe two main features are a double-buffered weight update (2BW) and flush mechanisms ensure high throughput. PipeDream-2BW\r\nsplits models into stages over multiple workers, and each stage is replicated an equal number of times (with data-parallel updates across replicas of the same stage).  Such parallel pipelines work well for models where each layer is repeated a fixed number of times (e.g., [transformer](https://paperswithcode.com/method/transformer) models).","description_state":"present","introduced_year":null,"introduced_by":{"title":"Memory-Efficient Pipeline-Parallel DNN Training","paper":"/paper/memory-efficient-pipeline-parallel-dnn","first_author":"Deepak Narayanan","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/memory-efficient-pipeline-parallel-dnn"},"source":{"url":"https://arxiv.org/abs/2006.09503v3","title":"Memory-Efficient Pipeline-Parallel DNN Training","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":"Asynchronous Pipeline Parallel","url":"/methods/category/asynchronous-pipeline-parallel","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Model Parallel Methods","url":"/methods/category/model-parallel-methods","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Distributed Methods","url":"/methods/category/distributed-methods","pwc_aliases":[]}],"n_papers_tagged":3,"archive_num_papers":3,"papers_newest_first":[{"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":"/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":"/paper/memory-efficient-pipeline-parallel-dnn","slug":"memory-efficient-pipeline-parallel-dnn","title":"Memory-Efficient Pipeline-Parallel DNN Training","date":"2020-06-16","arxiv_id":"2006.09503","n_code_links":1,"syntology":{"ran":2,"of":10,"n_ran_checked":2,"n_instrument":0,"unverified":8,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","official":null}}],"papers_shown":3,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":3,"with_a_code_link":3,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":3,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"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":1,"papers_where_code_ran_first_page":"/method/pipedream-2bw/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/pipedream-2bw/papers/ran/1","json":"/method/pipedream-2bw/papers/ran/1.json","rows":1}],"tasks":[{"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/sentiment-analysis","name":"Sentiment Analysis","papers":1},{"task":"/task/image-classification","name":"image-classification","papers":1}],"tasks_shown":5,"n_tasks":5,"usage_by_year":[{"year":"2020","papers":1},{"year":"2021","papers":1},{"year":"2023","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/pipedream-2bw"},"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-2BW","read_at":"2026-10-05T01:00:18+00:00","query":"PipeDream-2BW","kind":"method","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":{"method":"PipeDream-2BW","origin_arxiv_id":"2006.09503"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2006.09503","repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"listed_only"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2006.09503","citations":307},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'PipeDream-2BW'. 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":"2006.09503","page":"/paper/memory-efficient-pipeline-parallel-dnn","syntology_url":"https://syntology.ai/paper/2006.09503","in_graph_layer":true,"samples":10,"ran":2,"n_ran_checked":2,"n_instrument":0,"unverified":8,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: listed only). This answer is about arXiv:2006.09503, the paper the archive credits with this method.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"e40718c6d76f713ecfd11d9d9223c67847b1945073ccfada4ae059177aee1e60","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}