A Quadratic Self-Scheduling Algorithm for Heterogeneous Distributed Computing Systems

Scheduling algorithms play an important role in heterogeneous computing systems. Development of new scheduling strategies is an active research field. In this context, we present a general formulation of the self-scheduling problem, deriving a new, quadratic, self-scheduling algorithm. Initial tests comparing the performance of the new algorithm against well-established ones are carried out. Thus, working at the application level, we allocate sets of several thousand tasks in an Internet-based grid of computers that involves a transatlantic connection. In all the tests, the new algorithm performs better than the previous ones