A greedy randomized adaptive search procedure for scheduling IoT tasks in virtualized fog–cloud computing

IF 2.5 4区 计算机科学 Q3 TELECOMMUNICATIONS Transactions on Emerging Telecommunications Technologies Pub Date : 2024-04-24 DOI:10.1002/ett.4980
Rezvan Salimi, Sadoon Azizi, Jemal Abawajy
{"title":"A greedy randomized adaptive search procedure for scheduling IoT tasks in virtualized fog–cloud computing","authors":"Rezvan Salimi,&nbsp;Sadoon Azizi,&nbsp;Jemal Abawajy","doi":"10.1002/ett.4980","DOIUrl":null,"url":null,"abstract":"<p>Virtualized fog–cloud computing (VFCC) has emerged as an optimal platform for processing the increasing number of emerging Internet of Things (IoT) applications. VFCC resources are provisioned to IoT applications in the form of virtual machines (VMs). Effectively utilizing VMs for diverse IoT tasks with varying requirements poses a significant challenge due to their heterogeneity in processing power, communication delay, and energy consumption. In addressing this challenge, in this article, we propose a system model for scheduling IoT tasks in VFCCs, considering not only individual task deadlines but also the system's overall energy consumption. Subsequently, we employ a greedy randomized adaptive search procedure (GRASP) to determine the optimal assignment of IoT tasks among VMs. GRASP, a metaheuristic-based technique, offers appealing characteristics, including simplicity, ease of implementation, a limited number of tuning parameters, and the potential for parallel implementation. Our comprehensive experiments evaluate the effectiveness of the proposed method, comparing its performance with the most advanced algorithms. The results demonstrate that the proposed approach outperforms the existing methods in terms of deadline satisfaction ratio, average response time, energy consumption, and makespan.</p>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"35 5","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Emerging Telecommunications Technologies","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/ett.4980","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Virtualized fog–cloud computing (VFCC) has emerged as an optimal platform for processing the increasing number of emerging Internet of Things (IoT) applications. VFCC resources are provisioned to IoT applications in the form of virtual machines (VMs). Effectively utilizing VMs for diverse IoT tasks with varying requirements poses a significant challenge due to their heterogeneity in processing power, communication delay, and energy consumption. In addressing this challenge, in this article, we propose a system model for scheduling IoT tasks in VFCCs, considering not only individual task deadlines but also the system's overall energy consumption. Subsequently, we employ a greedy randomized adaptive search procedure (GRASP) to determine the optimal assignment of IoT tasks among VMs. GRASP, a metaheuristic-based technique, offers appealing characteristics, including simplicity, ease of implementation, a limited number of tuning parameters, and the potential for parallel implementation. Our comprehensive experiments evaluate the effectiveness of the proposed method, comparing its performance with the most advanced algorithms. The results demonstrate that the proposed approach outperforms the existing methods in terms of deadline satisfaction ratio, average response time, energy consumption, and makespan.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
虚拟化雾云计算中物联网任务调度的贪婪随机自适应搜索程序
虚拟雾云计算(VFCC)已成为处理日益增多的新兴物联网(IoT)应用的最佳平台。VFCC 资源以虚拟机(VM)的形式提供给物联网应用。由于虚拟机在处理能力、通信延迟和能耗方面的异质性,如何有效地利用虚拟机来完成具有不同要求的各种物联网任务成为一个重大挑战。为应对这一挑战,我们在本文中提出了在 VFCC 中调度物联网任务的系统模型,不仅考虑了单个任务的截止日期,还考虑了系统的整体能耗。随后,我们采用贪婪随机自适应搜索程序(GRASP)来确定虚拟机之间物联网任务的最优分配。GRASP 是一种基于元启发式的技术,具有吸引人的特点,包括简单、易于实施、调整参数数量有限以及并行实施的潜力。我们的综合实验评估了所提方法的有效性,并将其性能与最先进的算法进行了比较。结果表明,所提出的方法在截止日期满足率、平均响应时间、能耗和时间跨度方面都优于现有方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
8.90
自引率
13.90%
发文量
249
期刊介绍: ransactions on Emerging Telecommunications Technologies (ETT), formerly known as European Transactions on Telecommunications (ETT), has the following aims: - to attract cutting-edge publications from leading researchers and research groups around the world - to become a highly cited source of timely research findings in emerging fields of telecommunications - to limit revision and publication cycles to a few months and thus significantly increase attractiveness to publish - to become the leading journal for publishing the latest developments in telecommunications
期刊最新文献
Issue Information An IoT-Based 5G Wireless Sensor Network Employs a Secure Routing Methodology Leveraging DCNN Processing Research and Implementation of a Classification Method of Industrial Big Data for Security Management Moving Target Detection in Clutter Environment Based on Track Posture Hypothesis Testing Spiking Quantum Fire Hawk Network Based Reliable Scheduling for Lifetime Maximization of Wireless Sensor Network
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1