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)
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.