一种具有设置成本的云调度改进算法

Redwan A. Al-dilami, Ammar Thabit Zahary Adnan Zain Al-Saqqaf
{"title":"一种具有设置成本的云调度改进算法","authors":"Redwan A. Al-dilami, Ammar Thabit Zahary Adnan Zain Al-Saqqaf","doi":"10.17781/P002468","DOIUrl":null,"url":null,"abstract":"The study aimed at investigating the problem of online task scheduling of identifying job of MapReduce on cloud computing infrastructures. It was proposed that the virtualized cloud computing setup comprised machines that host multiple identical virtual machines (VMs) under pay-as-you-go charging and booting a VM requires a constant setup time. The problem occurs when the VMs turning off after finishing processing a task and running it again for another. The goal is to limit the delay resulted from setting up the VMs, and to minimize the idle cost (VM does not find any task to possess) when VM is continuing in an active state without processing tasks. It was a constant number of VMs in an activation state continuity, and the cost of idle was distributed over existing tasks where the cost should be less than the cost of setting up one VM. The researchers' algorithm limited the delay resulted from setting up the VMs, the cost resulted from the continuing VMs in an active state without processing tasks was distributed to the current tasks fairly. The known cases was discussed where the duration of each task was known upon its arrival.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Enhanced Algorithm for Cloud Scheduling with Setup Cost\",\"authors\":\"Redwan A. Al-dilami, Ammar Thabit Zahary Adnan Zain Al-Saqqaf\",\"doi\":\"10.17781/P002468\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The study aimed at investigating the problem of online task scheduling of identifying job of MapReduce on cloud computing infrastructures. It was proposed that the virtualized cloud computing setup comprised machines that host multiple identical virtual machines (VMs) under pay-as-you-go charging and booting a VM requires a constant setup time. The problem occurs when the VMs turning off after finishing processing a task and running it again for another. The goal is to limit the delay resulted from setting up the VMs, and to minimize the idle cost (VM does not find any task to possess) when VM is continuing in an active state without processing tasks. It was a constant number of VMs in an activation state continuity, and the cost of idle was distributed over existing tasks where the cost should be less than the cost of setting up one VM. The researchers' algorithm limited the delay resulted from setting up the VMs, the cost resulted from the continuing VMs in an active state without processing tasks was distributed to the current tasks fairly. The known cases was discussed where the duration of each task was known upon its arrival.\",\"PeriodicalId\":211757,\"journal\":{\"name\":\"International journal of new computer architectures and their applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of new computer architectures and their applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17781/P002468\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of new computer architectures and their applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17781/P002468","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本研究旨在探讨MapReduce在云计算基础设施上识别作业的在线任务调度问题。有人提出,虚拟云计算设置包括托管多个相同的虚拟机(VM)的机器,按按需付费,并且启动虚拟机需要恒定的设置时间。当虚拟机在完成一个任务后关闭,并再次运行另一个任务时,会出现该问题。目标是限制由设置VM引起的延迟,并在VM继续处于活动状态而不处理任务时最小化空闲成本(VM找不到任何要拥有的任务)。它是处于激活状态连续性的恒定数量的VM,并且空闲的成本分布在现有任务上,其中成本应该小于设置一个VM的成本。研究人员的算法限制了虚拟机设置的延迟,将虚拟机处于活动状态而不处理任务所产生的成本公平地分配给当前任务。讨论了已知的情况,其中每个任务的持续时间在其到达时已知。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Enhanced Algorithm for Cloud Scheduling with Setup Cost
The study aimed at investigating the problem of online task scheduling of identifying job of MapReduce on cloud computing infrastructures. It was proposed that the virtualized cloud computing setup comprised machines that host multiple identical virtual machines (VMs) under pay-as-you-go charging and booting a VM requires a constant setup time. The problem occurs when the VMs turning off after finishing processing a task and running it again for another. The goal is to limit the delay resulted from setting up the VMs, and to minimize the idle cost (VM does not find any task to possess) when VM is continuing in an active state without processing tasks. It was a constant number of VMs in an activation state continuity, and the cost of idle was distributed over existing tasks where the cost should be less than the cost of setting up one VM. The researchers' algorithm limited the delay resulted from setting up the VMs, the cost resulted from the continuing VMs in an active state without processing tasks was distributed to the current tasks fairly. The known cases was discussed where the duration of each task was known upon its arrival.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信