A Learning Automata-based Scheduling for Deadline Sensitive Task in The Cloud

Sampa Sahoo, B. Sahoo, A. K. Turuk
{"title":"A Learning Automata-based Scheduling for Deadline Sensitive Task in The Cloud","authors":"Sampa Sahoo, B. Sahoo, A. K. Turuk","doi":"10.1109/services51467.2021.00021","DOIUrl":null,"url":null,"abstract":"Cloud computing is a revolutionary paradigm, which allows applications to run in a virtualized environment. The application runs on a virtual cloud resource makes the system scalable and cost-efficient. Noticeably many applications, such as healthcare systems, video streaming, Internet of Things (IoT) running in the cloud, are real-time in nature, i.e., these applications demand responses within a particular time limit, i.e., deadline. To meet the requirement of such applications, a Cloud Service Provider (CSP) must have a sufficient number of cloud resources (virtual machines). Further, the ever-growing demand for applications forces a CSP to deploy more and more cloud resources. Inevitably, the massive count of cloud resources in a cloud data center consumes a tremendous amount of energy. Specifically, it becomes cumbersome to offer services to deadline-sensitive tasks while minimizing energy consumption. An efficient task scheduling is an attractive way to reduce energy usage while ensuring satisfactory services for cloud users. Learning Automata (LA) is a reinforcement-based adaptive decision-making unit that learns and selects the best action from a set of actions applied in a dynamic environment. Similar to LA, in task scheduling, the best task and virtual machine combinations are chosen from a set of available combinations. In this context, this paper implemented the LA technique to solve a bi-objective deadline-sensitive task scheduling problem which includes minimization of energy consumption and makespan. At first, a learning automata-based scheduling framework is designed for deadline-sensitive tasks in the cloud. Later, a scheduling algorithm, namely, the LA-based Scheduling (LAS) algorithm, is proposed. The LAS algorithm exploits the heterogeneity of tasks and virtual machines (VMs) while guaranteeing the task’s deadline. Extensive simulation is carried out to designate the effectiveness and applicability of LAS for deadline-sensitive task scheduling in the heterogeneous cloud environment.","PeriodicalId":210534,"journal":{"name":"2021 IEEE World Congress on Services (SERVICES)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE World Congress on Services (SERVICES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/services51467.2021.00021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Cloud computing is a revolutionary paradigm, which allows applications to run in a virtualized environment. The application runs on a virtual cloud resource makes the system scalable and cost-efficient. Noticeably many applications, such as healthcare systems, video streaming, Internet of Things (IoT) running in the cloud, are real-time in nature, i.e., these applications demand responses within a particular time limit, i.e., deadline. To meet the requirement of such applications, a Cloud Service Provider (CSP) must have a sufficient number of cloud resources (virtual machines). Further, the ever-growing demand for applications forces a CSP to deploy more and more cloud resources. Inevitably, the massive count of cloud resources in a cloud data center consumes a tremendous amount of energy. Specifically, it becomes cumbersome to offer services to deadline-sensitive tasks while minimizing energy consumption. An efficient task scheduling is an attractive way to reduce energy usage while ensuring satisfactory services for cloud users. Learning Automata (LA) is a reinforcement-based adaptive decision-making unit that learns and selects the best action from a set of actions applied in a dynamic environment. Similar to LA, in task scheduling, the best task and virtual machine combinations are chosen from a set of available combinations. In this context, this paper implemented the LA technique to solve a bi-objective deadline-sensitive task scheduling problem which includes minimization of energy consumption and makespan. At first, a learning automata-based scheduling framework is designed for deadline-sensitive tasks in the cloud. Later, a scheduling algorithm, namely, the LA-based Scheduling (LAS) algorithm, is proposed. The LAS algorithm exploits the heterogeneity of tasks and virtual machines (VMs) while guaranteeing the task’s deadline. Extensive simulation is carried out to designate the effectiveness and applicability of LAS for deadline-sensitive task scheduling in the heterogeneous cloud environment.
基于学习自动机的云环境中期限敏感任务调度
云计算是一种革命性的范例,它允许应用程序在虚拟化环境中运行。应用程序在虚拟云资源上运行,使系统具有可伸缩性和成本效益。值得注意的是,许多应用程序,如医疗保健系统、视频流、在云中运行的物联网(IoT),本质上都是实时的,也就是说,这些应用程序需要在特定的时间限制内(即截止日期)做出响应。为了满足这些应用程序的需求,云服务提供商(CSP)必须拥有足够数量的云资源(虚拟机)。此外,对应用程序不断增长的需求迫使CSP部署越来越多的云资源。不可避免地,云数据中心中大量的云资源消耗了大量的能源。具体来说,为期限敏感的任务提供服务,同时尽量减少能源消耗,这变得很麻烦。高效的任务调度是一种有吸引力的方式,可以减少能源使用,同时确保为云用户提供满意的服务。学习自动机(LA)是一种基于强化的自适应决策单元,它从动态环境中应用的一组动作中学习并选择最佳动作。与LA类似,在任务调度中,从一组可用组合中选择最佳任务和虚拟机组合。在此背景下,本文采用LA技术解决了一个包含能耗最小化和完工时间最小化的双目标期限敏感任务调度问题。首先,为云中的期限敏感任务设计了一个基于学习自动机的调度框架。随后,提出了一种调度算法,即基于la的调度算法(LAS)。LAS算法在保证任务期限的同时,利用了任务和虚拟机的异构性。进行了大量的仿真,以确定LAS在异构云环境下对截止日期敏感任务调度的有效性和适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信