By Topic

Dynamic task assignment in heterogeneous linear array networks for metacomputing

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)
Sang-Young Cho ; Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea ; Kyu Ho Park

In a heterogeneous computing system, the tasks of a program must be assigned to the heterogeneous machines so as to utilize the computational capabilities and resources of the system efficiently. This paper deals with a dynamic task assignment problem in heterogeneous computing systems, which permits each task to be relocated from machine to machine during the execution of a program. This problem is known to be NP-complete in the general case. In this paper, we extend the network-flow approach of C.-H. Lee, D. Lee and M. Kim (1992) to dynamic assignment for metacomputing. The dynamic assignment problem for a linear array network is first transformed into the network flow problem, and then solved by applying the Goldberg-Tarjan's (1988) network flow algorithm in time not worse than O(n2m2φ2 log nmφ), where n, m, and φ are the numbers of machines, tasks, and phases of program execution, respectively

Published in:

Heterogeneous Computing Workshop, 1994., Proceedings

Date of Conference:

26 Apr 1994