Research Area:  Cloud Computing
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.
Author(s) Name:  Abhishek Mishra & Prasoon Trivedi
Journal name:  Cluster Computing
Publisher name:  Springer
Volume Information:  volume 23, pages 537–553 (2020)
Paper Link:   https://link.springer.com/article/10.1007/s10586-019-02943-z