Hybrid Genetic Algorithm for Bi-Criteria Multiprocessor Task Scheduling with Communication Delay

Abstract

Present work considers the minimization of the bi-criteria function including weighted sum of makespan and total completion time for a Multiprocessor task scheduling problem.Genetic algorithm is the most Keywords:Multiprocessor task scheduling, heuristics, Hybrid Genetic algorithm, makespan, Total Completion time. 1.INTRODUCTIONParallel processing is the most promising approach for meeting the increased computational requirements thathas introduced a number of problems including multiprocessor task scheduling. Usually a large program is divided into smaller tasks havingsome dependencies representing the precedence constraints such that a task cannot be started until all its predecessors have finished. The goal of a task scheduling algorithm is to schedule all the tasks on the given number of available processors without violating precedence constraints so as to minimize the different performance measures in order to maximize the throughput and utilization of the system. The multiprocessor task scheduling problem with precedence constraints belongs to the class of NP hard problems and its importance led to several comparative studies. The conventional research on scheduling considers heuristic based algorithms which are divided into three categories: list scheduling, clustering based and duplication based. Among heuristic algorithms, List scheduling algorithms are commonly used and work by assigning priority to each task according to attributes such as t-level (top level), b-level (bottom level), static level (sl) and ALAP (As Late As Possible)

Task Allocation Strategies for FPGA Based Heterogeneous System on Chip

“…The generic problem of efficient task allocation on heterogeneous multiprocessor systems (with CPUs and GPUs or Processors having different instruction sets) have drawn considerable research interest in last few years [6,7]. One stream of researchers [8,9] have delved towards finding out the efficient allocation schemes for dependent task sets. On the other hand, a plethora of research works [10,11] are available which dealt with independent tasks sets.…”