How should compilers represent fork-join parallelism?
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.
Main Author: | Moses, William S. (William Steven) |
---|---|
Other Authors: | Charles E. Leiserson and Tao B. Schardl. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2018
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/113124 |
Similar Items
-
Enabling the Rust Compiler to Reason about Fork/Join Parallelism via Tapir
by: Hilton, Jay
Published: (2024) -
Helper locks for fork-join parallel programming
by: Agrawal, Kunal, et al.
Published: (2011) -
Compiling for parallel multithreaded computation on symmetric multiprocessors
by: Shaw, Andrew, 1968-
Published: (2009) -
Implementing compiler optimizations using parallel graph reduction
by: Kulik, Joanna L. (Joanna Lynn)
Published: (2007) -
Compiling array computations for the Fresh Breeze Parallel Processor
by: Ginzburg, Igor Arkadiy
Published: (2008)