An Efficient Deadline Based Priority Job Scheduling in Mobile Cloud Computing

IF 1.5 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC
Muhammad Makama Mahmudur Rahman Ohee, Fernaz Narin Nur, Asif Karim, Shaheena Sultana, Sami Azam, Nazmun Nessa Moon
{"title":"An Efficient Deadline Based Priority Job Scheduling in Mobile Cloud Computing","authors":"Muhammad Makama Mahmudur Rahman Ohee,&nbsp;Fernaz Narin Nur,&nbsp;Asif Karim,&nbsp;Shaheena Sultana,&nbsp;Sami Azam,&nbsp;Nazmun Nessa Moon","doi":"10.1049/cmu2.70031","DOIUrl":null,"url":null,"abstract":"<p>Mobile cloud computing (MCC) combines the portability of mobile devices with cloud data centers to provide advanced services. MCC serves us in various ways in our daily lives, including multimedia streaming, mobile gaming, mobile corporate apps, and data-intensive mobile applications such as augmented reality and virtual reality. Among the several challenges involved in achieving the best performance for this service, job scheduling emerges as a particularly critical one. User satisfaction, cloud service provider requirements, user priority, cloud provider's resource limitation, user deadline, cloud provider's energy consumption, etc., are the main constraints while maintaining job scheduling in mobile cloud computing. To improve the quality of service (QoS) and achieve the effectiveness of job scheduling, we have proposed a multi-objective model to balance the situation between user gratification and the cloud service provider's demand. To optimize the cost efficiency of the virtual machine, two types of jobs represent unconstrained and constrained jobs in the cloud data center. The shortest execution first scheduling (SEFS) algorithm is applied for the unconstrained job, and efficient deadline and priority job scheduling (EDPS) algorithm is applied for the constrained job. Our proposed algorithm improves the performance of the existing state-of-the-art algorithms. Reducing the execution time of jobs and minimizing the resource consumption of cloud providers are the improvements of our proposed algorithm.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"19 1","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.70031","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Communications","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/cmu2.70031","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Mobile cloud computing (MCC) combines the portability of mobile devices with cloud data centers to provide advanced services. MCC serves us in various ways in our daily lives, including multimedia streaming, mobile gaming, mobile corporate apps, and data-intensive mobile applications such as augmented reality and virtual reality. Among the several challenges involved in achieving the best performance for this service, job scheduling emerges as a particularly critical one. User satisfaction, cloud service provider requirements, user priority, cloud provider's resource limitation, user deadline, cloud provider's energy consumption, etc., are the main constraints while maintaining job scheduling in mobile cloud computing. To improve the quality of service (QoS) and achieve the effectiveness of job scheduling, we have proposed a multi-objective model to balance the situation between user gratification and the cloud service provider's demand. To optimize the cost efficiency of the virtual machine, two types of jobs represent unconstrained and constrained jobs in the cloud data center. The shortest execution first scheduling (SEFS) algorithm is applied for the unconstrained job, and efficient deadline and priority job scheduling (EDPS) algorithm is applied for the constrained job. Our proposed algorithm improves the performance of the existing state-of-the-art algorithms. Reducing the execution time of jobs and minimizing the resource consumption of cloud providers are the improvements of our proposed algorithm.

Abstract Image

移动云计算中一种高效的基于截止日期的优先级作业调度方法
移动云计算(MCC)将移动设备的可移植性与云数据中心相结合,提供先进的服务。MCC在我们的日常生活中以各种方式为我们服务,包括多媒体流媒体,移动游戏,移动企业应用程序以及增强现实和虚拟现实等数据密集型移动应用程序。在实现此服务的最佳性能所涉及的几个挑战中,作业调度是一个特别关键的挑战。用户满意度、云服务提供商需求、用户优先级、云提供商的资源限制、用户期限、云提供商的能耗等是移动云计算中维持作业调度的主要制约因素。为了提高服务质量(QoS)和实现作业调度的有效性,我们提出了一个多目标模型来平衡用户满意度和云服务提供商需求之间的关系。为了优化虚拟机的成本效率,在云数据中心中,有两种类型的作业代表无约束作业和约束作业。对无约束的作业采用最短执行优先调度算法(SEFS),对有约束的作业采用高效截止日期和优先级调度算法(EDPS)。我们提出的算法提高了现有最先进算法的性能。减少作业的执行时间和最大限度地减少云提供商的资源消耗是我们提出的算法的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IET Communications
IET Communications 工程技术-工程:电子与电气
CiteScore
4.30
自引率
6.20%
发文量
220
审稿时长
5.9 months
期刊介绍: IET Communications covers the fundamental and generic research for a better understanding of communication technologies to harness the signals for better performing communication systems using various wired and/or wireless media. This Journal is particularly interested in research papers reporting novel solutions to the dominating problems of noise, interference, timing and errors for reduction systems deficiencies such as wasting scarce resources such as spectra, energy and bandwidth. Topics include, but are not limited to: Coding and Communication Theory; Modulation and Signal Design; Wired, Wireless and Optical Communication; Communication System Special Issues. Current Call for Papers: Cognitive and AI-enabled Wireless and Mobile - https://digital-library.theiet.org/files/IET_COM_CFP_CAWM.pdf UAV-Enabled Mobile Edge Computing - https://digital-library.theiet.org/files/IET_COM_CFP_UAV.pdf
×
引用
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学术官方微信