Learning Automata Based Algorithms for Mapping of a Class of Independent Tasks over Highly Heterogeneous Grids
Author(s) -
Shamsollah Ghanbari,
M. R. Meybodi
Publication year - 2005
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-26918-5
DOI - 10.1007/11508380_69
Subject(s) - computer science , grid , class (philosophy) , task (project management) , distributed computing , grid computing , learning automata , symmetric multiprocessor system , automaton , theoretical computer science , algorithm , parallel computing , artificial intelligence , mathematics , geometry , management , economics
Computational grid provides a platform for exploiting various computational resources over wide area networks. One of the concerns in implementing computational grid environment is how to effectively map tasks onto resources in order to gain high utilization in the highly heterogeneous environment of the grid. In this paper, three algorithms for task mapping based on learning automata are introduced. To show the effectiveness of the proposed algorithms, computer simulations have been conducted. The results of experiments show that the proposed algorithms outperform two best existing mapping algorithms when the heterogeneity of the environment is very high.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom