Executing Task Graphs Using Work-Stealing
NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Cilk++. We prove that Nabbit executes static task graphs in parallel in time which is asymptotically optimal for graphs whose nodes...
Main Authors: | Agrawal, Kunal, Leiserson, Charles E., Sukha, Jim |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
Online Access: | http://hdl.handle.net/1721.1/73204 https://orcid.org/0000-0001-8783-0274 |
Similar Items
-
On the efficiency of localized work stealing
by: Suksompong, Warut, et al.
Published: (2019) -
Helper locks for fork-join parallel programming
by: Agrawal, Kunal, et al.
Published: (2011) -
Using memory mapping to support cactus stacks in work-stealing runtime systems
by: Lee, I-Ting Angelina, et al.
Published: (2011) -
Upper Bounds on Number of Steals in Rooted Trees
by: Leiserson, Charles E., et al.
Published: (2016) -
Bounds on multithreaded computations by work stealing
by: Suksompong, Warut
Published: (2014)