By Topic

Dynamic adaptation of DAGs with uncertain execution times in heterogeneous computing systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Qin Zheng ; Adv. Comput. Programme, Inst. of High Performance Comput., Singapore, Singapore

In this paper, we consider the problem of schedule DAGs with uncertainties in task execution times. Firstly, given an offline planned schedule based on the estimated task execution times, we consider when the schedule should be adapted during runtime based on the current information about the start and completion times of its tasks. The objective is to limit the number of runtime adaptations upon task overruns and underruns and minimize the response time of the DAG. We then consider the case without offline planned schedules and discuss dynamic planning and adaptation of tasks. We conduct extensive simulation experiments to quantify the performance of the proposed algorithms.

Published in:

Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on

Date of Conference:

19-23 April 2010