![DSpace logo](/jspui/image/logo.gif)
Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14737
Title: | Benchmarking the contention aware nature inspired metaheuristic task scheduling algorithms |
Authors: | Mishra, Abhishek |
Keywords: | Computer Science Genetic Algorithm (GA) Differential Evolution (DE) Particle swarm optimization (PSO) |
Issue Date: | May-2019 |
Publisher: | Springer |
Abstract: | In this paper, we consider the contention aware task scheduling problem on a grid topology of processors. By contention awareness, we mean that simultaneous communication on a link has to be serialized. To solve this problem, we propose several nature inspired metaheuristic algorithms: Simulated Annealing (SA), Genetic Algorithm (GA), Differential Evolution (DE), Particle Swarm Optimization (PSO), Bat Algorithm (BA), Cuckoo Search (CS), and Firefly Algorithm (FA). We perform benchmark evaluation of these algorithms for the Normalized Schedule Length (NSL) parameter. The benchmark task graphs that we consider are: random task graphs, peer set task graphs, systolic array task graphs, Gaussian elimination task graphs, divide and conquer task graphs, and fast Fourier transform task graphs. |
URI: | https://link.springer.com/article/10.1007/s10586-019-02943-z http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14737 |
Appears in Collections: | Department of Computer Science and Information Systems |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.