Copyright Notice:

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Publications of SPCL

P. Kambadur, A. Gupta, T. Hoefler, A. Lumsdaine:

 Demand-driven Execution of Static Directed Acyclic Graphs Using Task Parallelism

(. Vol , Nr. , In , presented in Kochi, India, pages 284-293, , ISSN: , ISBN: 978-1-4244-4922-4, Dec. 2009, )


The dataflow model allows natural expression of parallelism in an application. Applications expressed in the dataflow model can be executed either using the data-driven or the demand-driven schemes. Although both these schemes have their utility in different scenarios, the realization of the demand-driven scheme is not adequately supported in the existing solutions for task parallelism. In this paper, we examine some of the requirements placed by the demand-driven execution scheme on task parallelism. We present PFunc, a new library-based solution for task parallelism that fully supports the demand-driven execution scheme. We compare the runtimes and peak memory consumption of an unsymmetric sparse LU factorization emulation parallelized using both the data- and demand-driven execution schemes. This comparison shows that the demand-driven model provides benefits that necessitate its full support in task parallelism.


download slides:


  author={P. Kambadur and A. Gupta and Torsten Hoefler and Andrew Lumsdaine},
  title={{Demand-driven Execution of Static Directed Acyclic Graphs Using Task Parallelism}},
  location={Kochi, India},