An Iterated Local Search Algorithm for Task Assignment in Distributed Computing Systems

Article Preview

Abstract:

This paper considers the problem of task assignment in heterogeneous distributed computing systems with the goal of minimizing the total execution and communication costs. An iterated local search algorithm is proposed for finding the suboptimal task assignment in a reasonable amount of computation time. We study the performance of the proposed algorithm over a wide range of parameters such as the problem scales, the ratio of average communication time to average computation time, and task interaction density of applications. The effectiveness of the algorithm is manifested by comparing it with other competing algorithms in the relevant literature.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 588-589)

Pages:

1308-1311

Citation:

Online since:

November 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Stone HS. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Transactions on Software Engineering 1977, 3 (1): 85-93.

DOI: 10.1109/tse.1977.233840

Google Scholar

[2] Chern MS, Chen GH, Liu P. An LC branch-and-bound algorithm for module assignment problem. Information Processing Letters 1989, 32: 61-71.

DOI: 10.1016/0020-0190(89)90032-x

Google Scholar

[3] Chockalingam T, Arunkumar S. Genetic algorithm based heuristics for the mapping problem. Computer and Operations Research 1995, 22: 55-64.

DOI: 10.1016/0305-0548(94)p2435-7

Google Scholar

[4] Hamam Y, Hindi KS. Assignment of program modules to processors: a simulated annealing approach. European Journal of Operational Research 2000, 122: 509-513.

DOI: 10.1016/s0377-2217(99)00251-9

Google Scholar

[5] Yin PY, Yu SS, Wang PP, Wang YT. A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems. Computer Standard and Interface 2006, 28: 441-450.

DOI: 10.1016/j.csi.2005.03.005

Google Scholar

[6] Zou DX, Gao LQ, Li S, Wu JH, Wang X. A novel global harmony search algorithm for task assignment problem. Journal of Systems and Software 2010, 83(10): 1678-1688.

DOI: 10.1016/j.jss.2010.04.070

Google Scholar

[7] Lourenço HR, Martin OC, Stützle T. Iterated local search. In F.W. Glover and G.A. Kochenberger (Eds. ) Handbook of Metaheuristics. Kluwer Academic Publishers, Boston, USA; 2003, pp.321-353.

DOI: 10.1007/0-306-48056-5_11

Google Scholar

[8] Shatz SM, Wang JP, Goto M. Task allocation for maximizing reliability of distributed computer systems. IEEE Transactions on Computers 1992, 41: 1156-1168.

DOI: 10.1109/12.165396

Google Scholar