مشتق الگوریتم های خود برنامه ریزی برای سیستم های کامپیوتری توزیع ناهمگن: کاربرد شبکه های اینترنتی رایانه

Self-scheduling algorithms are useful for achieving load balance in heterogeneous computational systems. Therefore, they can be applied in computational Grids. Here, we introduce two families of self-scheduling algorithms. The first considers an explicit form for the chunks distribution function. The second focuses on the variation rate of the chunks distribution function. From the first family, we propose a Quadratic Self-Scheduling (QSS) algorithm. From the second, two new algorithms, Exponential Self-Scheduling (ESS) and Root Self-Scheduling (RSS) are introduced. QSS, ESS and RSS are tested in an Internet-based Grid of Computers involving resources from Spain and Mexico. QSS and ESS outperform previous self-scheduling algorithms. QSS is found slightly more efficient than ESS. RSS shows a poor performance, a fact traced back to the curvature of the chunks distribution function.