@inproceedings{
 title = {Demand-driven execution of static directed acyclic graphs using task parallelism},
 type = {inproceedings},
 year = {2009},
 keywords = {Data flow analysis,Data-driven; Dataflow model; Directed acyclic grap},
 pages = {284-293},
 websites = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77952233198&doi=10.1109%2FHIPC.2009.5433201&partnerID=40&md5=e3cbcb881ef9b21aa55ff964cd183566},
 city = {Kochi},
 id = {02b51817-e820-3b3d-9332-70c152b434e4},
 created = {2018-01-09T20:30:38.615Z},
 file_attached = {false},
 profile_id = {42d295c0-0737-38d6-8b43-508cab6ea85d},
 last_modified = {2018-03-12T19:03:18.546Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {Kambadur2009284},
 source_type = {conference},
 notes = {cited By 3; Conference of 16th International Conference on High Performance Computing, HiPC 2009 ; Conference Date: 16 December 2009 Through 19 December 2009; Conference Code:80205},
 folder_uuids = {2aba6c14-9027-4f47-8627-0902e1e2342b},
 private_publication = {false},
 abstract = {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. ©2009 IEEE.},
 bibtype = {inproceedings},
 author = {Kambadur, P and Gupta, A and Hoefler, T and Lumsdaine, A},
 doi = {10.1109/HIPC.2009.5433201},
 booktitle = {16th International Conference on High Performance Computing, HiPC 2009 - Proceedings}
}

{"_id":"BL4BiL6L7GmJe5fDg","bibbaseid":"kambadur-gupta-hoefler-lumsdaine-demanddrivenexecutionofstaticdirectedacyclicgraphsusingtaskparallelism-2009","downloads":0,"creationDate":"2018-03-12T19:10:28.106Z","title":"Demand-driven execution of static directed acyclic graphs using task parallelism","author_short":["Kambadur, P.","Gupta, A.","Hoefler, T.","Lumsdaine, A."],"year":2009,"bibtype":"inproceedings","biburl":"https://bibbase.org/service/mendeley/42d295c0-0737-38d6-8b43-508cab6ea85d","bibdata":{"title":"Demand-driven execution of static directed acyclic graphs using task parallelism","type":"inproceedings","year":"2009","keywords":"Data flow analysis,Data-driven; Dataflow model; Directed acyclic grap","pages":"284-293","websites":"https://www.scopus.com/inward/record.uri?eid=2-s2.0-77952233198&doi=10.1109%2FHIPC.2009.5433201&partnerID=40&md5=e3cbcb881ef9b21aa55ff964cd183566","city":"Kochi","id":"02b51817-e820-3b3d-9332-70c152b434e4","created":"2018-01-09T20:30:38.615Z","file_attached":false,"profile_id":"42d295c0-0737-38d6-8b43-508cab6ea85d","last_modified":"2018-03-12T19:03:18.546Z","read":false,"starred":false,"authored":"true","confirmed":"true","hidden":false,"citation_key":"Kambadur2009284","source_type":"conference","notes":"cited By 3; Conference of 16th International Conference on High Performance Computing, HiPC 2009 ; Conference Date: 16 December 2009 Through 19 December 2009; Conference Code:80205","folder_uuids":"2aba6c14-9027-4f47-8627-0902e1e2342b","private_publication":false,"abstract":"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. ©2009 IEEE.","bibtype":"inproceedings","author":"Kambadur, P and Gupta, A and Hoefler, T and Lumsdaine, A","doi":"10.1109/HIPC.2009.5433201","booktitle":"16th International Conference on High Performance Computing, HiPC 2009 - Proceedings","bibtex":"@inproceedings{\n title = {Demand-driven execution of static directed acyclic graphs using task parallelism},\n type = {inproceedings},\n year = {2009},\n keywords = {Data flow analysis,Data-driven; Dataflow model; Directed acyclic grap},\n pages = {284-293},\n websites = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77952233198&doi=10.1109%2FHIPC.2009.5433201&partnerID=40&md5=e3cbcb881ef9b21aa55ff964cd183566},\n city = {Kochi},\n id = {02b51817-e820-3b3d-9332-70c152b434e4},\n created = {2018-01-09T20:30:38.615Z},\n file_attached = {false},\n profile_id = {42d295c0-0737-38d6-8b43-508cab6ea85d},\n last_modified = {2018-03-12T19:03:18.546Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Kambadur2009284},\n source_type = {conference},\n notes = {cited By 3; Conference of 16th International Conference on High Performance Computing, HiPC 2009 ; Conference Date: 16 December 2009 Through 19 December 2009; Conference Code:80205},\n folder_uuids = {2aba6c14-9027-4f47-8627-0902e1e2342b},\n private_publication = {false},\n abstract = {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. ©2009 IEEE.},\n bibtype = {inproceedings},\n author = {Kambadur, P and Gupta, A and Hoefler, T and Lumsdaine, A},\n doi = {10.1109/HIPC.2009.5433201},\n booktitle = {16th International Conference on High Performance Computing, HiPC 2009 - Proceedings}\n}","author_short":["Kambadur, P.","Gupta, A.","Hoefler, T.","Lumsdaine, A."],"urls":{"Website":"https://www.scopus.com/inward/record.uri?eid=2-s2.0-77952233198&doi=10.1109%2FHIPC.2009.5433201&partnerID=40&md5=e3cbcb881ef9b21aa55ff964cd183566"},"biburl":"https://bibbase.org/service/mendeley/42d295c0-0737-38d6-8b43-508cab6ea85d","bibbaseid":"kambadur-gupta-hoefler-lumsdaine-demanddrivenexecutionofstaticdirectedacyclicgraphsusingtaskparallelism-2009","role":"author","keyword":["Data flow analysis","Data-driven; Dataflow model; Directed acyclic grap"],"metadata":{"authorlinks":{}},"downloads":0},"search_terms":["demand","driven","execution","static","directed","acyclic","graphs","using","task","parallelism","kambadur","gupta","hoefler","lumsdaine"],"keywords":["data flow analysis","data-driven; dataflow model; directed acyclic grap"],"authorIDs":[],"dataSources":["zgahneP4uAjKbudrQ","ya2CyA73rpZseyrZ8","2252seNhipfTmjEBQ"]}