By Topic

Reliable matching and scheduling of precedence-constrained tasks in heterogeneous distributed computing

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

2 Author(s)
Dogan, A. ; Dept. of Electr. Eng., Ohio State Univ., Columbus, OH, USA ; Ozguner, F.

In this paper, two cost functions that can be incorporated into a matching and scheduling algorithm for tasks with precedence constraints are introduced to enable the algorithm to consider the reliability of different resources in the system while making decisions. The cost functions introduced are unique in the sense that they are not restricted to tree-based networks and a specific matching and scheduling algorithm. As an example, cost functions are applied to a compile time, static list scheduling heuristic. The simulation results confirm that the proposed cost functions can be exploited to produce task assignments where the effect of failures of machines and network resources on the execution of the application is reduced

Published in:

Parallel Processing, 2000. Proceedings. 2000 International Conference on

Date of Conference:

2000