用于优化科学云工作流中的时间跨度和成本的多目标乌鸦搜索算法(CSAMOMC)

IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, THEORY & METHODS
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}
引用次数: 0

摘要

如今,随着云计算技术在处理物联网(IoT)工作负载方面的迅速扩展,对数据中心的需求大幅增加,导致二氧化碳排放量、电力消耗和全球变暖问题激增。因此,为解决这一问题,人们开展了广泛的研究和行动。两种具体方法分别侧重于加强工作负载调度(一个被称为 NP-Hard 的复杂问题)和将调度整合到科学工作流中。在这项研究中,我们提出了一种多目标乌鸦搜索算法(CSA),用于优化科学云工作流(CSAMOMC)中的时间跨度和成本。我们将我们的方法与著名的 HEFT 算法和 TC3pop 算法进行了比较分析,这两种算法通常用于缩短时间跨度和优化成本。我们的研究结果表明,与上述算法相比,CSAMOMC 能够将平均有效期缩短 4.42%,将成本降低 4.77%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A multi-objective crow search algorithm for optimizing makespan and costs in scientific cloud workflows (CSAMOMC)

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
Computing 工程技术-计算机:理论方法
CiteScore
8.20
自引率
2.70%
发文量
107
审稿时长
3 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信