数据密集型云环境的动态调度方法

M. R. Islam, M. Habiba
{"title":"数据密集型云环境的动态调度方法","authors":"M. R. Islam, M. Habiba","doi":"10.1109/ICCCTAM.2012.6488094","DOIUrl":null,"url":null,"abstract":"The scheduling problem domain in cloud environment recently has been extended to deal with two new phenomenon such as data-intensive and security constraints in cloud environment. However traditional scheduling approaches have been failed to deal with these new addition. In this paper, the system architecture along with security constraint model for data-intensive cloud environment is designed. Moreover, a novel security constraints scheduling approach to schedule all jobs in cloud environment efficiently without compromising required security level for each job is presented in this paper. In the regard of cloud security, swarm intelligence is highly capable to provide better solutions for such potentially intractable problems. Therefore, an Ant Colony Optimization based scheduling algorithm is proposed in this paper. Several meta-heuristic mathematical models as well as explanations have been introduced to deal with effective security constraint scheduling strategy. Meanwhile, the experimental results shows that the overall performance of proposed scheduling algorithm is better than other existing scheduling algorithms on four basic measurements: the optimization rate of throughput, cost, CPU time and security constraints.","PeriodicalId":111485,"journal":{"name":"2012 International Conference on Cloud Computing Technologies, Applications and Management (ICCCTAM)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Dynamic scheduling approach for data-intensive cloud environment\",\"authors\":\"M. R. Islam, M. Habiba\",\"doi\":\"10.1109/ICCCTAM.2012.6488094\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The scheduling problem domain in cloud environment recently has been extended to deal with two new phenomenon such as data-intensive and security constraints in cloud environment. However traditional scheduling approaches have been failed to deal with these new addition. In this paper, the system architecture along with security constraint model for data-intensive cloud environment is designed. Moreover, a novel security constraints scheduling approach to schedule all jobs in cloud environment efficiently without compromising required security level for each job is presented in this paper. In the regard of cloud security, swarm intelligence is highly capable to provide better solutions for such potentially intractable problems. Therefore, an Ant Colony Optimization based scheduling algorithm is proposed in this paper. Several meta-heuristic mathematical models as well as explanations have been introduced to deal with effective security constraint scheduling strategy. Meanwhile, the experimental results shows that the overall performance of proposed scheduling algorithm is better than other existing scheduling algorithms on four basic measurements: the optimization rate of throughput, cost, CPU time and security constraints.\",\"PeriodicalId\":111485,\"journal\":{\"name\":\"2012 International Conference on Cloud Computing Technologies, Applications and Management (ICCCTAM)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Cloud Computing Technologies, Applications and Management (ICCCTAM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCTAM.2012.6488094\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Cloud Computing Technologies, Applications and Management (ICCCTAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCTAM.2012.6488094","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

最近,云环境下的调度问题领域得到了扩展,以处理云环境下的数据密集型和安全约束两种新现象。然而,传统的调度方法已经无法处理这些新的增加。本文设计了数据密集型云环境下的系统架构和安全约束模型。此外,本文还提出了一种新的安全约束调度方法,在不影响每个作业所需的安全级别的情况下,有效地调度云环境中的所有作业。在云安全方面,群体智能非常有能力为这些潜在的棘手问题提供更好的解决方案。为此,本文提出了一种基于蚁群优化的调度算法。介绍了几种元启发式数学模型及其解释,以处理有效的安全约束调度策略。同时,实验结果表明,本文提出的调度算法在吞吐量优化率、成本、CPU时间和安全约束等四个基本指标上的总体性能优于现有的调度算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic scheduling approach for data-intensive cloud environment
The scheduling problem domain in cloud environment recently has been extended to deal with two new phenomenon such as data-intensive and security constraints in cloud environment. However traditional scheduling approaches have been failed to deal with these new addition. In this paper, the system architecture along with security constraint model for data-intensive cloud environment is designed. Moreover, a novel security constraints scheduling approach to schedule all jobs in cloud environment efficiently without compromising required security level for each job is presented in this paper. In the regard of cloud security, swarm intelligence is highly capable to provide better solutions for such potentially intractable problems. Therefore, an Ant Colony Optimization based scheduling algorithm is proposed in this paper. Several meta-heuristic mathematical models as well as explanations have been introduced to deal with effective security constraint scheduling strategy. Meanwhile, the experimental results shows that the overall performance of proposed scheduling algorithm is better than other existing scheduling algorithms on four basic measurements: the optimization rate of throughput, cost, CPU time and security constraints.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信