Quantum genetic algorithm with rotation angle refinement for dependent task scheduling on distributed systems
| Autor: | Tanvi Gandhi, Nitin, Taj Alam |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
020203 distributed computing
Job shop scheduling Computer science Distributed computing 02 engineering and technology Direct acyclic graph Scheduling (computing) Quantum genetic algorithm 0202 electrical engineering electronic engineering information engineering Topological sorting 020201 artificial intelligence & image processing Minification Metaheuristic Quantum computer |
| Zdroj: | IC3 |
| DOI: | 10.1109/ic3.2017.8284295 |
| Popis: | Distributed systems are efficient means of realizing High-Performance Computing (HPC). They are used in meeting the demand of executing large-scale high-performance computational jobs. Scheduling the tasks on such computational resources is one of the prime concerns in the heterogeneous distributed systems. Scheduling jobs on such systems are NP-complete in nature. Scheduling requires either heuristic or metaheuristic approach for sub-optimal but acceptable solutions. An application can be divided into a number of tasks which can be represented as Direct Acyclic Graph (DAG). To accomplish high performance, it is important to efficiently schedule these dependent tasks on resources with the satisfaction of the constraints defined for schedule generation. Inspired by Quantum computing, this work proposes a Quantum Genetic Algorithm with Rotation Angle Refinement (QGARAR) for optimum schedule generation. In this paper, the proposed QGARAR is compared with its peers under various test conditions to account for minimization of the makespan value of dependent jobs submitted for execution on heterogeneous distributed systems. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|