Task management for irregular-parallel workloads on the GPU

  • Authors:

  • Stanley Tzeng;Anjul Patney;John D. Owens

  • Affiliations:

  • University of California, Davis;University of California, Davis;University of California, Davis

  • Venue:
  • Proceedings of the Conference on High Performance Graphics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We explore software mechanisms for managing irregular tasks on graphics processing units (GPUs). We demonstrate that dynamic scheduling and efficient memory management are critical problems in achieving high efficiency on irregular workloads. We experiment with several task-management techniques, ranging from the use of a single monolithic task queue to distributed queuing with task stealing and donation. On irregular workloads, we show that both centralized and distributed queues have more than 100 times as much idle times as our task-stealing and -donation queues. Our preferred choice is task-donation because of comparable performance to task-stealing while using less memory overhead. To help in this analysis, we use an artificial task-management system that monitors performance and memory usage to quantify the impact of these different techniques. We validate our results by implementing a Reyes renderer with its irregular split-and-dice workload that is able to achieve real-time framerates on a single GPU.