{"title":"A New Dynamic Method of Multiprocessor Scheduling using Modified Crow Search Optimization","authors":"Ronali Madhusmita Sahoo, S. Padhy, Kumar Debasis","doi":"10.1109/AISP53593.2022.9760642","DOIUrl":null,"url":null,"abstract":"The task scheduling problem in a heterogeneous multiprocessor system is a challenging area of research. This article proposes a population-based metaheuristic algorithm called Modified Crow Search Optimization (MCSO) algorithm to solve the task scheduling problem. In this paper, the task scheduling problem is considered an optimization problem. The MCSO algorithm is used to find out the minimum makespan and the speedup of the task scheduling problem. The proposed algorithm is compared with some standard algorithms like Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Shuffled Frog Leaping Algorithm (SFLA), and Crow Search Optimization (CSO). Experimental results prove that the proposed algorithm outperforms all the above algorithms in minimizing the makespan.","PeriodicalId":6793,"journal":{"name":"2022 2nd International Conference on Artificial Intelligence and Signal Processing (AISP)","volume":"16 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 2nd International Conference on Artificial Intelligence and Signal Processing (AISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AISP53593.2022.9760642","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The task scheduling problem in a heterogeneous multiprocessor system is a challenging area of research. This article proposes a population-based metaheuristic algorithm called Modified Crow Search Optimization (MCSO) algorithm to solve the task scheduling problem. In this paper, the task scheduling problem is considered an optimization problem. The MCSO algorithm is used to find out the minimum makespan and the speedup of the task scheduling problem. The proposed algorithm is compared with some standard algorithms like Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Shuffled Frog Leaping Algorithm (SFLA), and Crow Search Optimization (CSO). Experimental results prove that the proposed algorithm outperforms all the above algorithms in minimizing the makespan.