Efficiently Scheduling Task Dataflow Parallelism: A Comparison Between Swan and QUARK
Data(s) |
2015
|
---|---|
Resumo |
Increased system variability and irregularity of parallelism in applications put increasing demands on the ef- ficiency of dynamic task schedulers. This paper presents a new design for a work-stealing scheduler supporting both Cilk- style recursively parallel code and parallelism deduced from dataflow dependences. Initial evaluation on a set of linear algebra kernels demonstrates that our scheduler outperforms PLASMA’s QUARK scheduler by up to 12% on a 16-thread Intel Xeon and by up to 50% on a 32-thread AMD Bulldozer. |
Formato |
application/pdf |
Identificador |
http://pure.qub.ac.uk/ws/files/74502743/EASC15Proceedings.pdf |
Idioma(s) |
eng |
Publicador |
The University of Edinburgh |
Direitos |
info:eu-repo/semantics/openAccess |
Fonte |
Vandierendonck , H 2015 , Efficiently Scheduling Task Dataflow Parallelism: A Comparison Between Swan and QUARK . in Proceedings of the Exascale Applications and Software Conference 2015 . The University of Edinburgh , Edinburgh , pp. 36-41 , Exascale Applications and Software Conference 2015 , Edinburgh , United Kingdom , 21-23 April . |
Tipo |
contributionToPeriodical |