SPORT: An Algorithm for Divisible Load Scheduling with Result Collection on Heterogeneous Systems


IEICE TRANSACTIONS on Communications   Vol.E91-B   No.8   pp.2571-2588
Publication Date: 2008/08/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e91-b.8.2571
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
divisible load scheduling,  heterogeneous systems,  result collection,  

Full Text: PDF(835.8KB)>>
Buy this Article

Divisible Load Theory (DLT) is an established mathematical framework to study Divisible Load Scheduling (DLS). However, traditional DLT does not address the scheduling of results back to source (i.e., result collection), nor does it comprehensively deal with system heterogeneity. In this paper, the DLSRCHETS (DLS with Result Collection on HETerogemeous Systems) problem is addressed. The few papers to date that have dealt with DLSRCHETS, proposed simplistic LIFO (Last In, First Out) and FIFO (First In, First Out) type of schedules as solutions to DLSRCHETS. In this paper, a new polynomial time heuristic algorithm, SPORT (System Parameters based Optimized Result Transfer), is proposed as a solution to the DLSRCHETS problem. With the help of simulations, it is proved that the performance of SPORT is significantly better than existing algorithms. The other major contributions of this paper include, for the first time ever, (a) the derivation of the condition to identify the presence of idle time in a FIFO schedule for two processors, (b) the identification of the limiting condition for the optimality of FIFO and LIFO schedules for two processors, and (c) the introduction of the concept of equivalent processor in DLS for heterogeneous systems with result collection.