An Optimal Opportunistic Scheduling Algorithm for Parallel Tasks in a Cloudlet

Ou Wu
{"title":"An Optimal Opportunistic Scheduling Algorithm for Parallel Tasks in a Cloudlet","authors":"Ou Wu","doi":"10.1109/APSECW.2017.32","DOIUrl":null,"url":null,"abstract":"With the development of Cloud Computing (CC) and mobile Internet, Mobile Cloud Computing (MCC) is becoming a new application mode. Mobile Cloud Computing allows cloudlet (i.e. a trusted computer which well-connected to the Internet and available for user to process the computational tasks) to access the nearby users’ information for process at any time and any place. However, due to the mobility of the user and cloudlets, cloudlets may not be effectively control users information transmission. The PhD research work is mainly including the following four aspects: Firstly, we plan to calculate the effective range to ensure that the link between the users’mobile devices and the cloudlet in the whole task processing and transmission will not be interrupted. Secondly, since the cloudlet process tasks and transmission tasks need to consume energy, we discuss the minimum power cost problem as a time averaged optimization problem in order to save energy. Thirdly, we design two efficient algorithms by applying the Lyapunov optimization theory and virtual queue technology to ensure the cloudlet have an optimal scheduling strategy. Finally, we apply real-life power price to illustrate efficiency of our algorithms.","PeriodicalId":172357,"journal":{"name":"2017 24th Asia-Pacific Software Engineering Conference Workshops (APSECW)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 24th Asia-Pacific Software Engineering Conference Workshops (APSECW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSECW.2017.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the development of Cloud Computing (CC) and mobile Internet, Mobile Cloud Computing (MCC) is becoming a new application mode. Mobile Cloud Computing allows cloudlet (i.e. a trusted computer which well-connected to the Internet and available for user to process the computational tasks) to access the nearby users’ information for process at any time and any place. However, due to the mobility of the user and cloudlets, cloudlets may not be effectively control users information transmission. The PhD research work is mainly including the following four aspects: Firstly, we plan to calculate the effective range to ensure that the link between the users’mobile devices and the cloudlet in the whole task processing and transmission will not be interrupted. Secondly, since the cloudlet process tasks and transmission tasks need to consume energy, we discuss the minimum power cost problem as a time averaged optimization problem in order to save energy. Thirdly, we design two efficient algorithms by applying the Lyapunov optimization theory and virtual queue technology to ensure the cloudlet have an optimal scheduling strategy. Finally, we apply real-life power price to illustrate efficiency of our algorithms.
云环境下并行任务的最佳机会调度算法
随着云计算(CC)和移动互联网的发展,移动云计算(MCC)正在成为一种新的应用模式。移动云计算允许cloudlet(即与互联网良好连接并可供用户处理计算任务的可信计算机)在任何时间和任何地点访问附近用户的信息进行处理。但是,由于用户和cloudlets的移动性,cloudlets可能无法有效控制用户信息的传输。PhD的研究工作主要包括以下四个方面:首先,我们计划计算有效范围,以确保在整个任务处理和传输过程中,用户移动设备与云之间的链接不会中断。其次,由于云小处理任务和传输任务需要消耗能量,我们将最小功耗问题作为时间平均优化问题来讨论,以节省能量。第三,应用李雅普诺夫优化理论和虚拟队列技术设计了两种高效的算法,以确保云环境具有最优调度策略。最后,以实际电价为例说明算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信