About this resource
<p>Task scheduling problem in heterogeneous systems is the process of allocating tasks of an application to<br>heterogeneous processors interconnected by high-speed networks, so that minimizing the finishing time of<br>application as much as possible. Tasks are processing units of application and have precedenceconstrained, communication and also, are presented by Directed Acyclic Graphs (DAGs). Evolutionary<br>algorithms are well suited for solving task scheduling problem in heterogeneous environment. In this<br>paper, we propose a hybrid heuristic-based Artificial Immune System (AIS) algorithm for solving the<br>scheduling problem. In this regard, AIS with some heuristics and Single Neighbourhood Search (SNS)<br>technique are hybridized. Clonning and immune-remove operators of AIS provide diversity, while<br>heuristics and SNS provide convergence of algorithm into good solutions, that is balancing between<br>exploration and exploitation. We have compared our method with some state-of-the art algorithms. The<br>results of the experiments show the validity and efficiency of our method. </p>
Files and access
Resources are read online through DARE. Direct file links are not published; access is checked against DSpace when a document is opened. Authorised librarian workflows are unaffected.
This record contains bibliographic metadata, but no files are currently attached.
