Cooperative Kernels:阻塞算法的多任务处理(扩展版)的GPU
Cooperative Kernels: GPU Multitasking for Blocking Algorithms (Extended Version)
摘要:
在GPU上加速不规则数据并行算法的兴趣越来越大。这些算法通常是阻塞的,因此它们需要公平调度。但是GPU编程模型(例如\ OpenCL)并不强制要求公平调度,GPU调度器在实践中是不公平的。当前的方法通过以不允许GPU与其他工作负载(诸如图形渲染任务)共享的方式利用当今GPU的调度怪癖来避免这个问题。我们提出了合作的内核,扩展到传统的GPU编程模型面向编写阻塞算法。协作内核的工作组被公平地调度,并且通过一小部分内核和调度器协作的语言扩展来支持多任务处理。我们描述了在OpenCL 2.0中实现的合作内核框架的原型实现,并通过将一组阻塞GPU应用程序移植到合作内核并在多任务下检查其性能来评估我们的方法。我们的原型利用没有供应商特定的硬件,驱动程序或编译器的支持,因此我们的研究结果提供了一个下限的合作内核可以在实践中实现的效率。
英文摘要:
There is growing interest in accelerating irregular data-parallel algorithms on GPUs. These algorithms are typically blocking, so they require fair scheduling. But GPU programming models (e.g.\ OpenCL) do not mandate fair scheduling, and GPU schedulers are unfair in practice. Current approaches avoid this issue by exploiting scheduling quirks of today's GPUs in a manner that does not allow the GPU to be shared with other workloads (such as graphics rendering tasks). We propose cooperative kernels, an extension to the traditional GPU programming model geared towards writing blocking algorithms. Workgroups of a cooperative kernel are fairly scheduled, and multitasking is supported via a small set of language extensions through which the kernel and scheduler cooperate. We describe a prototype implementation of a cooperative kernel framework implemented in OpenCL 2.0 and evaluate our approach by porting a set of blocking GPU applications to cooperative kernels and examining their performance under multitasking. Our prototype exploits no vendor-specific hardware, driver or compiler support, thus our results provide a lower-bound on the efficiency with which cooperative kernels can be implemented in practice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。