Name
Abstract | ||
|---|---|---|
This paper describes QuickSched, a compact and efficient Open-Source C-language library for task-based shared-memory parallel programming. QuickSched extends the standard dependency-only scheme of task-based programming with the concept of task conflicts, i.e.~sets of tasks that can be executed in any order, yet not concurrently. These conflicts are modelled using exclusively lockable hierarchical resources. The scheduler itself prioritizes tasks along the critical path of execution and is shown to perform and scale well on a 64-core parallel shared-memory machine for two example problems: A tiled QR decomposition and a task-based Barnes-Hut tree code. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Distributed, Parallel, and Cluster Computing | Task analysis,Computer science,Parallel computing,Real-time computing,Critical path method,QR decomposition,Distributed computing |
DocType | Volume | Citations |
Journal | abs/1601.05384 | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pedro Gonnet | 1 | 89 | 13.43 |
| Aidan B. G. Chalk | 2 | 4 | 2.18 |
| Matthieu Schaller | 3 | 4 | 2.85 |