Reza Akraminejad, Navid Khaledian, Amin Nazari, Marcus Voelp
{"title":"用于优化科学云工作流中的时间跨度和成本的多目标乌鸦搜索算法(CSAMOMC)","authors":"Reza Akraminejad, Navid Khaledian, Amin Nazari, Marcus Voelp","doi":"10.1007/s00607-024-01263-4","DOIUrl":null,"url":null,"abstract":"<p>Nowadays, with the rapid expansion of cloud computing technology in processing Internet of Things (IoT) workloads, the demand for data centers has significantly increased, leading to a surge in CO<sub>2</sub> emissions, power consumption, and global warming. As a result, extensive research and initiatives have been undertaken to tackle this problem. Two specific approaches focus on enhancing workload scheduling, a complex problem known as NP-Hard, and integrating scheduling into scientific workflows. In this investigation, we present a multi-objective Crow Search Algorithm (CSA) for optimizing both makespan and costs in scientific cloud workflows (CSAMOMC). We conduct a comparative analysis between our approach and the well-known HEFT and TC3pop algorithms, which are commonly used for reducing makespan and optimizing costs. Our findings demonstrate that CSAMOMC is capable of achieving an average makespan reduction of 4.42% and a cost reduction of 4.77% when compared to the aforementioned algorithms.</p>","PeriodicalId":10718,"journal":{"name":"Computing","volume":"11 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A multi-objective crow search algorithm for optimizing makespan and costs in scientific cloud workflows (CSAMOMC)\",\"authors\":\"Reza Akraminejad, Navid Khaledian, Amin Nazari, Marcus Voelp\",\"doi\":\"10.1007/s00607-024-01263-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Nowadays, with the rapid expansion of cloud computing technology in processing Internet of Things (IoT) workloads, the demand for data centers has significantly increased, leading to a surge in CO<sub>2</sub> emissions, power consumption, and global warming. As a result, extensive research and initiatives have been undertaken to tackle this problem. Two specific approaches focus on enhancing workload scheduling, a complex problem known as NP-Hard, and integrating scheduling into scientific workflows. In this investigation, we present a multi-objective Crow Search Algorithm (CSA) for optimizing both makespan and costs in scientific cloud workflows (CSAMOMC). We conduct a comparative analysis between our approach and the well-known HEFT and TC3pop algorithms, which are commonly used for reducing makespan and optimizing costs. Our findings demonstrate that CSAMOMC is capable of achieving an average makespan reduction of 4.42% and a cost reduction of 4.77% when compared to the aforementioned algorithms.</p>\",\"PeriodicalId\":10718,\"journal\":{\"name\":\"Computing\",\"volume\":\"11 1\",\"pages\":\"\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2024-02-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00607-024-01263-4\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00607-024-01263-4","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
A multi-objective crow search algorithm for optimizing makespan and costs in scientific cloud workflows (CSAMOMC)
Nowadays, with the rapid expansion of cloud computing technology in processing Internet of Things (IoT) workloads, the demand for data centers has significantly increased, leading to a surge in CO2 emissions, power consumption, and global warming. As a result, extensive research and initiatives have been undertaken to tackle this problem. Two specific approaches focus on enhancing workload scheduling, a complex problem known as NP-Hard, and integrating scheduling into scientific workflows. In this investigation, we present a multi-objective Crow Search Algorithm (CSA) for optimizing both makespan and costs in scientific cloud workflows (CSAMOMC). We conduct a comparative analysis between our approach and the well-known HEFT and TC3pop algorithms, which are commonly used for reducing makespan and optimizing costs. Our findings demonstrate that CSAMOMC is capable of achieving an average makespan reduction of 4.42% and a cost reduction of 4.77% when compared to the aforementioned algorithms.
期刊介绍:
Computing publishes original papers, short communications and surveys on all fields of computing. The contributions should be written in English and may be of theoretical or applied nature, the essential criteria are computational relevance and systematic foundation of results.