By Topic

A Quadratic Self-Scheduling Algorithm for Heterogeneous Distributed Computing Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Diaz, J. ; Escuela Superior de Informatica, Univ. de Castilla-La Mancha, Ciudad Real ; Reyes, S. ; Nino, A. ; Munoz-Caro, C.

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

Published in:

Cluster Computing, 2006 IEEE International Conference on

Date of Conference:

25-28 Sept. 2006