A comparison of multiprocessor task scheduling algorithms with communication costs

Abstract

Both parallel and distributed network environment systems play a vital role in the improvement of high performance computing. Of primary concern when analyzing these systems is multiprocessor task scheduling. Therefore, this paper addresses the challenge of multiprocessor task scheduling parallel programs, represented as directed acyclic task graph (DAG), for execution onmultiprocessors with communication costs.Moreover, we investigate an alternative paradigm, where genetic algorithms (GAs) have recently received much attention, which is a class of robust stochastic search algorithms for various combinatorial optimization problems. We design the new encodingmechanismwith a multi-functional chromosome that uses the priority representation—the so-called priority-based multi-chromosome (PMC). PMC can efficiently represent a task schedule and assign tasks to processors. The proposed priority-based GA has show effective performance in various parallel environments for scheduling methods. 2006 Elsevier Ltd. All rights reserved.

DOI: 10.1016/j.cor.2006.05.013

Statistics

010202008200920102011201220132014201520162017
Citations per Year

54 Citations

Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Hwang2008ACO, title={A comparison of multiprocessor task scheduling algorithms with communication costs}, author={Reakook Hwang and Mitsuo Gen and Hiroshi Katayama}, journal={Computers & OR}, year={2008}, volume={35}, pages={976-993} }