8196

Exploring Heterogeneous Scheduling using the Task-Centric Programming Model

Artur Podobas, Mats Brorsson, Vladimir Vlassov
Royal Institute of Technology, KTH
Tenth International Workshop Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms (HeteroPar’12), 2012
BibTeX

Download Download (PDF)   View View   Source Source   

2112

views

Computer architecture technology is moving towards more heterogeneous solutions, which will contain a number of processing units with different capabilities that may increase the performance of the system as a whole. However, with increased performance comes increased complexity; complexity that is now barely handled in homogeneous multiprocessing systems. The present study tries to solve a small piece of the heterogeneous puzzle; how can we exploit all system resources in a performance-effective and user-friendly way? Our proposed solution includes a run-time system capable of using a variety of different heterogeneous components while providing the user with the already familiar task-centric programming model interface. Furthermore, when dealing with nonuniform workloads, we show that traditional approaches based on centralized or work-stealing queue algorithms do not work well and propose a scheduling algorithm based on trend analysis to distribute work in a performance-effective way across resources.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2025 hgpu.org

All rights belong to the respective authors

Contact us:

contact@hpgu.org