A comparison of multiprocessor task scheduling algorithms with communication costs

A comparison of multiprocessor task scheduling algorithms with communication costs

0.00 Avg rating0 Votes
Article ID: iaor2009976
Country: United Kingdom
Volume: 35
Issue: 3
Start Page Number: 976
End Page Number: 993
Publication Date: Mar 2008
Journal: Computers and Operations Research
Authors: , ,
Keywords: communication
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, for execution on multiprocessors 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 encoding mechanism with 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 shown effective performance in various parallel environments for scheduling methods.

Reviews

Required fields are marked *. Your email address will not be published.