可配置的工作窃取策略
Configurable Strategies for Work-stealing
摘要:
工作窃取系统通常不知道他们正在调度的任务的性质。例如,它们不知道或考虑任务将花费多长时间执行或它将产生多少子任务。此外,实际任务执行顺序通常由底层任务存储数据结构确定,并且不能改变。因此,存在通过向调度系统提供关于特定任务及其优选执行顺序的信息来优化任务并行执行的可能性。我们引入调度策略,使应用程序能够动态地提供提示的任务调度系统的性质,特定的任务。调度策略可用于独立控制本地任务执行顺序以及窃取顺序。与通常在范围上是全局的常规调度策略相比,策略允许调度器对单个任务应用优化。这种灵活性大大提高了可组合性,因为它允许调度程序同时为应用程序的不同部分应用不同的特定调度选择。我们提出了一些基准,突出不同的,有益的效果,可以实现与调度策略。一些基准测试(分支绑定、单源最短路径)表明,与标准的工作窃取执行顺序相比,任务的优先级可以减少工作总量。对于其他基准测试(三角带生成),可以在更短的时间内获得更好的质量结果。其他优化,如动态合并任务或窃取一半的工作,而不是一半的任务,也被证明可以提高性能。组合性的例子,结合不同的策略,无论是在同一内核(前缀和),以及当调度多个内核(前缀和不平衡树搜索)。
英文摘要:
Work-stealing systems are typically oblivious to the nature of the tasks they are scheduling. For instance, they do not know or take into account how long a task will take to execute or how many subtasks it will spawn. Moreover, the actual task execution order is typically determined by the underlying task storage data structure, and cannot be changed. There are thus possibilities for optimizing task parallel executions by providing information on specific tasks and their preferred execution order to the scheduling system. We introduce scheduling strategies to enable applications to dynamically provide hints to the task-scheduling system on the nature of specific tasks. Scheduling strategies can be used to independently control both local task execution order as well as steal order. In contrast to conventional scheduling policies that are normally global in scope, strategies allow the scheduler to apply optimizations on individual tasks. This flexibility greatly improves composability as it allows the scheduler to apply different, specific scheduling choices for different parts of applications simultaneously. We present a number of benchmarks that highlight diverse, beneficial effects that can be achieved with scheduling strategies. Some benchmarks (branch-and-bound, single-source shortest path) show that prioritization of tasks can reduce the total amount of work compared to standard work-stealing execution order. For other benchmarks (triangle strip generation) qualitatively better results can be achieved in shorter time. Other optimizations, such as dynamic merging of tasks or stealing of half the work, instead of half the tasks, are also shown to improve performance. Composability is demonstrated by examples that combine different strategies, both within the same kernel (prefix sum) as well as when scheduling multiple kernels (prefix sum and unbalanced tree search).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。