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 (Contributor), Leiserson, Charles E. (Contributor), Sukha, Jim (Author), Zhang, Zhunping (Contributor), Schardl, Tao Benjamin (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2014-09-22T16:51:38Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Deterministic parallel random-number generation for dynamic-multithreading platforms
by: Leiserson, Charles E., et al.
Published: (2016) -
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) -
Helper locks for fork-join parallel programming
by: Agrawal, Kunal, et al.
Published: (2011) -
The Cilkprof Scalability Profiler
by: Lee, I-Ting Angelina, et al.
Published: (2018) -
Executing Task Graphs Using Work-Stealing
by: Agrawal, Kunal, et al.
Published: (2012)