Citation
Dynamic Data Structures for Taskgraph Scheduling Policies with Applications in OpenCL Accelerators. In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA, pages 322-334, 2011.
Paper
Abstract
OpenCL is an emerging open framework for parallel programming in heterogenous systems. OpenCL accelerators need to schedule the execution of submitted jobs with no (or only very imprecise) estimates of execution times, but respecting dependencies among them, which are given in the form of directed acyclic graph. This problem is known as stochastic taskgraph scheduling, stochastic scheduling with precedencies, or stochastic scheduling with data dependencies. We study the complexity of implementing out-of-order static scheduling policies, which approach optimality in the long run, under certain simplifying assumptions. We present a simple data structure allowing for the what next" query of a number of out-of-order taskgraph scheduling policies to be answered in time O(1), while vertices can be added in time O(1).
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2011-322-334-P, author = {J. Marecek and A. J. Parkes and E. K. Burke and Robert Elliot and H. Francis and A. Lokhmotov},
title = {Dynamic Data Structures for Taskgraph Scheduling Policies with Applications in OpenCL Accelerators},
booktitle = {In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA},
year = {2011},
editor = {J. Fowler and G. Kendall and B. McCollum},
pages = {322--334},
note = {Paper},
abstract = {OpenCL is an emerging open framework for parallel programming in heterogenous systems. OpenCL accelerators need to schedule the execution of submitted jobs with no (or only very imprecise) estimates of execution times, but respecting dependencies among them, which are given in the form of directed acyclic graph. This problem is known as stochastic taskgraph scheduling, stochastic scheduling with precedencies, or stochastic scheduling with data dependencies. We study the complexity of implementing out-of-order static scheduling policies, which approach optimality in the long run, under certain simplifying assumptions. We present a simple data structure allowing for the \what next" query of a number of out-of-order taskgraph scheduling policies to be answered in time O(1), while vertices can be added in time O(1).},
owner = {gxk},
timestamp = {2011.08.15},
webpdf = {2011-322-334-P.pdf} }