Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Executing Task Graphs Using Work-Stealing Kunal Agrawal
 

Summary: Executing Task Graphs Using Work-Stealing
Kunal Agrawal
Washington University in St Louis
St Louis, MO 63130, USA
Charles E. Leiserson Jim Sukha
Massachusetts Institute of Technology
Cambridge, MA 02139, USA
Abstract--NABBIT is a work-stealing library for execu-
tion of task graphs with arbitrary dependencies which is
implemented as a library for the multithreaded program-
ming language Cilk++. We prove that NABBIT executes
static task graphs in parallel in time which is asymp-
totically optimal for graphs whose nodes have constant
in-degree and out-degree. To evaluate the performance of
NABBIT, we implemented a dynamic program representing
the Smith-Waterman algorithm, an irregular dynamic pro-
gram on a two-dimensional grid. Our experiments indicate
that when task-graph nodes are mapped to reasonably
sized blocks, NABBIT exhibits low overhead and scales as
well as or better than other scheduling strategies. The

  

Source: Agrawal, Kunal - Department of Computer Science and Engineering, Washington University in St. Louis
Leiserson, Charles E. - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

 

Collections: Computer Technologies and Information Sciences