By Topic

Multiple cost optimization for task assignment in heterogeneous computing systems using learning automata

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
$33 $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)
R. D. Venkataramana ; Dept. of Comput. Sci. & Eng., Univ. of South Florida, Tampa, FL, USA ; N. Ranganathan

A framework for task assignment in heterogeneous computing systems is presented in this work. The framework is based on a learning automata model. The proposed model can be used for dynamic task assignment and scheduling and can adapt itself to changes in the hardware or network environment. The important feature of the scheme is that it can work on multiple cost criteria, optimizing each criterion individually. The cost criterion could be a general metric like minimizing the total execution time, or an application specific metric defined by the user. The application task is modeled as a task flow graph (TFG), and the network of machines as a processor graph (PG). The automata model is constructed by associating every task in the TFG with a variable structure learning automaton. The actions of each automaton correspond to the nodes in the PG. The reinforcement scheme of the automaton considered is a linear scheme. Different heuristic techniques that guide the automata model to the optimal solution are presented. These heuristics are evaluated with respect to different cost metrics

Published in:

Heterogeneous Computing Workshop, 1999. (HCW '99) Proceedings. Eighth

Date of Conference: