Efficiently Scheduling Task Dataflow Parallelism: A Comparison Between Swan and QUARK
Lists
Only you see this
Abstract
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.
BibTeX
@inproceedings{vandierendonck2015efficiently,
author = {Hans Vandierendonck},
title = {{Efficiently Scheduling Task Dataflow Parallelism: A Comparison Between Swan and QUARK}},
booktitle = {Research},
year = {2015},
}Loading related content...