On-the-fly pipeline parallelism
Pipeline parallelism organizes a parallel program as a linear sequence of s stages. Each stage processes elements of a data stream, passing each processed data element to the next stage, and then taking on a new element before the subsequent stages have necessarily completed their processing. Pipeli...
Main Authors: | Lee, I-Ting Angelina, Leiserson, Charles E., Sukha, Jim, Zhang, Zhunping, Schardl, Tao Benjamin |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2014
|
Online Access: | http://hdl.handle.net/1721.1/90258 https://orcid.org/0000-0003-0198-3283 |
Similar Items
-
On-the-Fly Pipeline Parallelism
by: Lee, I-Ting Angelina, et al.
Published: (2022) -
On-the-Fly Pipeline Parallelism
by: Lee, I-Ting Angelina, et al.
Published: (2021) -
Deterministic parallel random-number generation for dynamic-multithreading platforms
by: Leiserson, Charles E., et al.
Published: (2016) -
Helper locks for fork-join parallel programming
by: Agrawal, Kunal, et al.
Published: (2011) -
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)
by: Leiserson, Charles E., et al.
Published: (2016)