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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Ghanbari, S., & Meybodi, M. R. (2005). Learning automata based algorithms for mapping of a class of independent tasks over highly heterogeneous grids. In Lecture Notes in Computer Science (Vol. 3470, pp. 681–690). Springer Verlag. https://doi.org/10.1007/11508380_69
Mendeley helps you to discover research relevant for your work.