Investigating of Probabilistic Load Balancing Algorithms in Grid Computing
The computing grid is a distributed parallel processing system that share and choosing resources dynamically and provide need of user operation power, cost and quality.grid management resources does as a diagnostic and assigning resources scheduling and resource monitoring in grid. Scheduling process directs tasks to suitable resources. It must take place somehow that load work distributed equally on resources to get the maximum interest out of existed resource, establishing load balancing is one the important performance factors in grid resource management efficiency, in this paper, a model in accordance with tree and probabilistic scheduling algorithms with load balancing purpose was suggested, that in this algorithm class of work, cost, deadline and herd behavior have considered. We investigate the probability of a resource success in different algorithms in accordance with complete time, execute time and cost. Probabilistic algorithms chooses the resources that have better past and leave the duties to it, in case of execution or nonexecution on the resource the source will give a reward or punishment.
Computing grid load balancing tree model probable
Mehdi Nikkhah Raheleh Safaeipour Mohsen Moradi
Computer Science Islamic Azad University, Beyza, Fars, Iran Computer Science Islamic Azad University,Ghier va karzin, Fars, Iran
国际会议
上海
英文
461-466
2010-06-22（万方平台首次上网日期，不代表论文的发表时间）