Task scheduling algorithm using minimized duplications in homogeneous systems

Task scheduling algorithm using minimized duplications in homogeneous systems
Load balancing and task assignment, Parallel processors, Scheduling and task partitioning, Distributed architectures
Issue Date
Series/Report no.
J. Parallel Distrib. Comput; Vol.2008 No.68
For fine grain task graphs, duplication-based scheduling algorithms are generally more efficient than list and cluster-based algorithms. However, most duplication-based heuristics try to duplicate all possible ancestor nodes of a given join node, in order to reduce the earliest start time (EST) of the join node, even though these ancestor nodes have already been allocated in previous steps. Thus, these duplication heuristics inevitably induce redundant duplications, which lead to the superfluous consumption of resources and generally deteriorate the scheduling result in the case of a bounded number of processors. When scheduling algorithms are used on an unbounded number of processors, the required number of processors grows excessively with the size of the task graph, thereby limiting the practicality of these algorithms for large task graphs. In this paper, we propose a novel algorithm designed to allocate join nodes without redundant duplications. In the proposed algorithm, if the ancestor nodes of a join node are duplicated when scheduling the join node, the original allocations of these ancestor nodes are removed using a very efficient method. The performance of the proposed algorithm, in terms of its normalized schedule length and efficiency, is compared with that of some of the recently proposed algorithms. The proposed algorithm generates better or comparable schedules with minimized duplication. Specifically, the simulation results show that it is most useful on a bounded number of processors.
Appears in Collections:
College of Engineering(공과대학) > Electrical Engineering (전기공학) > Local Access Journal, Report (전기공학 논문, 보고서)

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.